./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race-2.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race-2.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 588c01face7baa7cf65cc649c1ffef36a83824bf6956581c1ca3de7e95a23299
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-02-28 17:15:37,468 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 17:15:37,509 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-02-28 17:15:37,567 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-02-28 17:15:37,568 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-02-28 17:15:37,569 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-02-28 17:15:37,570 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-02-28 17:15:37,571 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-02-28 17:15:37,572 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-02-28 17:15:37,572 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-02-28 17:15:37,573 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-02-28 17:15:37,574 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-02-28 17:15:37,574 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-02-28 17:15:37,575 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-02-28 17:15:37,575 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-02-28 17:15:37,576 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-02-28 17:15:37,577 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-02-28 17:15:37,577 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-02-28 17:15:37,578 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-02-28 17:15:37,579 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-02-28 17:15:37,580 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-02-28 17:15:37,581 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-02-28 17:15:37,582 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-02-28 17:15:37,583 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-02-28 17:15:37,585 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-02-28 17:15:37,585 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-02-28 17:15:37,585 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-02-28 17:15:37,586 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-02-28 17:15:37,586 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-02-28 17:15:37,587 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-02-28 17:15:37,587 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-02-28 17:15:37,588 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-02-28 17:15:37,588 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-02-28 17:15:37,589 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-02-28 17:15:37,589 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-02-28 17:15:37,589 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-02-28 17:15:37,590 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-02-28 17:15:37,590 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-02-28 17:15:37,590 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-02-28 17:15:37,591 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-02-28 17:15:37,591 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-02-28 17:15:37,592 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 17:15:37,608 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-02-28 17:15:37,608 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 17:15:37,608 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 17:15:37,608 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 17:15:37,609 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 17:15:37,609 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 17:15:37,610 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 17:15:37,610 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 17:15:37,610 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-02-28 17:15:37,610 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 17:15:37,610 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-02-28 17:15:37,610 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-02-28 17:15:37,610 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 17:15:37,610 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 17:15:37,610 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 17:15:37,611 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 17:15:37,611 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 17:15:37,611 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 17:15:37,611 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 17:15:37,611 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-02-28 17:15:37,611 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 17:15:37,611 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-02-28 17:15:37,611 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 17:15:37,611 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 17:15:37,611 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 17:15:37,611 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 17:15:37,612 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 17:15:37,612 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 17:15:37,612 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 17:15:37,612 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-02-28 17:15:37,612 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 17:15:37,612 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 17:15:37,612 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 17:15:37,612 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 17:15:37,612 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 17:15:37,612 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 17:15:37,613 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-02-28 17:15:37,613 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 588c01face7baa7cf65cc649c1ffef36a83824bf6956581c1ca3de7e95a23299
[2024-02-28 17:15:38,881 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 17:15:39,229 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 17:15:39,231 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 17:15:39,231 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-02-28 17:15:39,232 INFO  L275        PluginConnector]: CDTParser initialized
[2024-02-28 17:15:39,233 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race-2.i
[2024-02-28 17:15:41,441 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 17:15:41,636 INFO  L351              CDTParser]: Found 1 translation units.
[2024-02-28 17:15:41,636 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race-2.i
[2024-02-28 17:15:41,646 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/e0673cb4a/379e5fc10bfc4ecfb1e907b42cc0f0a0/FLAG5af089c6a
[2024-02-28 17:15:41,657 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/e0673cb4a/379e5fc10bfc4ecfb1e907b42cc0f0a0
[2024-02-28 17:15:41,658 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 17:15:41,659 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 17:15:41,660 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 17:15:41,660 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 17:15:41,663 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 17:15:41,664 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 05:15:41" (1/1) ...
[2024-02-28 17:15:41,665 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488a5e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:15:41, skipping insertion in model container
[2024-02-28 17:15:41,665 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 05:15:41" (1/1) ...
[2024-02-28 17:15:41,671 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-02-28 17:15:41,707 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-02-28 17:15:41,818 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 17:15:41,980 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 17:15:41,986 INFO  L203         MainTranslator]: Completed pre-run
[2024-02-28 17:15:41,995 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 17:15:42,017 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 17:15:42,052 INFO  L208         MainTranslator]: Completed translation
[2024-02-28 17:15:42,053 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:15:42 WrapperNode
[2024-02-28 17:15:42,053 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 17:15:42,054 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 17:15:42,054 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 17:15:42,054 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 17:15:42,059 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:15:42" (1/1) ...
[2024-02-28 17:15:42,074 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:15:42" (1/1) ...
[2024-02-28 17:15:42,095 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85
[2024-02-28 17:15:42,095 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 17:15:42,096 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 17:15:42,096 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 17:15:42,096 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 17:15:42,103 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:15:42" (1/1) ...
[2024-02-28 17:15:42,103 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:15:42" (1/1) ...
[2024-02-28 17:15:42,106 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:15:42" (1/1) ...
[2024-02-28 17:15:42,106 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:15:42" (1/1) ...
[2024-02-28 17:15:42,112 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:15:42" (1/1) ...
[2024-02-28 17:15:42,115 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:15:42" (1/1) ...
[2024-02-28 17:15:42,116 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:15:42" (1/1) ...
[2024-02-28 17:15:42,117 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:15:42" (1/1) ...
[2024-02-28 17:15:42,119 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 17:15:42,120 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 17:15:42,120 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 17:15:42,120 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-02-28 17:15:42,120 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:15:42" (1/1) ...
[2024-02-28 17:15:42,125 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 17:15:42,132 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:15:42,191 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-02-28 17:15:42,195 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-02-28 17:15:42,358 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 17:15:42,359 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-02-28 17:15:42,359 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 17:15:42,359 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-02-28 17:15:42,360 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 17:15:42,360 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 17:15:42,360 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-02-28 17:15:42,360 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 17:15:42,360 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 17:15:42,361 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 17:15:42,361 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 17:15:42,365 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-02-28 17:15:42,807 INFO  L235             CfgBuilder]: Building ICFG
[2024-02-28 17:15:42,810 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 17:15:43,161 INFO  L276             CfgBuilder]: Performing block encoding
[2024-02-28 17:15:43,167 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 17:15:43,168 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 17:15:43,170 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:15:43 BoogieIcfgContainer
[2024-02-28 17:15:43,170 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 17:15:43,171 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 17:15:43,172 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 17:15:43,174 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-02-28 17:15:43,174 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 05:15:41" (1/3) ...
[2024-02-28 17:15:43,174 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a951f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 05:15:43, skipping insertion in model container
[2024-02-28 17:15:43,174 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:15:42" (2/3) ...
[2024-02-28 17:15:43,175 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a951f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 05:15:43, skipping insertion in model container
[2024-02-28 17:15:43,175 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:15:43" (3/3) ...
[2024-02-28 17:15:43,179 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race-2.i
[2024-02-28 17:15:43,189 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 17:15:43,199 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 17:15:43,200 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2024-02-28 17:15:43,200 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 17:15:43,253 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 17:15:43,295 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 238 flow
[2024-02-28 17:15:43,393 INFO  L130       PetriNetUnfolder]: 6/165 cut-off events.
[2024-02-28 17:15:43,393 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 17:15:43,397 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 171 conditions, 165 events. 6/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 334 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2024-02-28 17:15:43,397 INFO  L82        GeneralOperation]: Start removeDead. Operand has 114 places, 115 transitions, 238 flow
[2024-02-28 17:15:43,400 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 114 places, 115 transitions, 238 flow
[2024-02-28 17:15:43,403 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 17:15:43,411 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 115 transitions, 238 flow
[2024-02-28 17:15:43,413 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 115 transitions, 238 flow
[2024-02-28 17:15:43,413 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 238 flow
[2024-02-28 17:15:43,440 INFO  L130       PetriNetUnfolder]: 6/165 cut-off events.
[2024-02-28 17:15:43,440 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 17:15:43,440 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 171 conditions, 165 events. 6/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 334 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2024-02-28 17:15:43,442 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2052
[2024-02-28 17:15:45,869 INFO  L134        LiptonReduction]: Checked pairs total: 12265
[2024-02-28 17:15:45,869 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2024-02-28 17:15:45,882 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 17:15:45,887 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59fcf406, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 17:15:45,887 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-02-28 17:15:45,888 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-02-28 17:15:45,888 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 17:15:45,888 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:15:45,889 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-02-28 17:15:45,889 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:15:45,893 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:15:45,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 381, now seen corresponding path program 1 times
[2024-02-28 17:15:45,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:15:45,901 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482424706]
[2024-02-28 17:15:45,901 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:15:45,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:15:46,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:15:46,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:15:46,138 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:15:46,138 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482424706]
[2024-02-28 17:15:46,139 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482424706] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:15:46,139 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:15:46,139 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-02-28 17:15:46,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189396219]
[2024-02-28 17:15:46,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:15:46,147 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-02-28 17:15:46,147 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:15:46,160 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-02-28 17:15:46,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-02-28 17:15:46,163 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193
[2024-02-28 17:15:46,164 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 108 flow. Second operand  has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:46,164 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:15:46,165 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193
[2024-02-28 17:15:46,165 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:15:46,212 INFO  L130       PetriNetUnfolder]: 33/213 cut-off events.
[2024-02-28 17:15:46,212 INFO  L131       PetriNetUnfolder]: For 4/7 co-relation queries the response was YES.
[2024-02-28 17:15:46,213 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 308 conditions, 213 events. 33/213 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1010 event pairs, 32 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 250. Up to 88 conditions per place. 
[2024-02-28 17:15:46,214 INFO  L137   encePairwiseOnDemand]: 192/193 looper letters, 16 selfloop transitions, 0 changer transitions 0/49 dead transitions.
[2024-02-28 17:15:46,214 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 138 flow
[2024-02-28 17:15:46,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-02-28 17:15:46,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-02-28 17:15:46,225 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 237 transitions.
[2024-02-28 17:15:46,227 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6139896373056994
[2024-02-28 17:15:46,228 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 237 transitions.
[2024-02-28 17:15:46,232 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 237 transitions.
[2024-02-28 17:15:46,233 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:15:46,251 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 237 transitions.
[2024-02-28 17:15:46,256 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:46,262 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:46,263 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:46,265 INFO  L175             Difference]: Start difference. First operand has 52 places, 50 transitions, 108 flow. Second operand 2 states and 237 transitions.
[2024-02-28 17:15:46,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 138 flow
[2024-02-28 17:15:46,267 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:15:46,268 INFO  L231             Difference]: Finished difference. Result has 52 places, 49 transitions, 106 flow
[2024-02-28 17:15:46,270 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=49}
[2024-02-28 17:15:46,272 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places.
[2024-02-28 17:15:46,273 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 106 flow
[2024-02-28 17:15:46,273 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:46,273 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:15:46,273 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:15:46,273 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 17:15:46,273 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:15:46,274 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:15:46,274 INFO  L85        PathProgramCache]: Analyzing trace with hash -835068003, now seen corresponding path program 1 times
[2024-02-28 17:15:46,274 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:15:46,274 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324497333]
[2024-02-28 17:15:46,274 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:15:46,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:15:46,308 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:15:46,596 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:15:46,597 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:15:46,597 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324497333]
[2024-02-28 17:15:46,597 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324497333] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:15:46,597 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:15:46,597 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:15:46,597 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436888982]
[2024-02-28 17:15:46,597 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:15:46,598 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:15:46,598 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:15:46,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:15:46,599 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:15:46,765 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2024-02-28 17:15:46,766 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 106 flow. Second operand  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:46,766 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:15:46,766 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2024-02-28 17:15:46,766 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:15:46,933 INFO  L130       PetriNetUnfolder]: 245/703 cut-off events.
[2024-02-28 17:15:46,934 INFO  L131       PetriNetUnfolder]: For 7/9 co-relation queries the response was YES.
[2024-02-28 17:15:46,935 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 703 events. 245/703 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4008 event pairs, 86 based on Foata normal form. 1/658 useless extension candidates. Maximal degree in co-relation 1296. Up to 291 conditions per place. 
[2024-02-28 17:15:46,937 INFO  L137   encePairwiseOnDemand]: 170/193 looper letters, 61 selfloop transitions, 29 changer transitions 0/102 dead transitions.
[2024-02-28 17:15:46,937 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 102 transitions, 395 flow
[2024-02-28 17:15:46,938 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:15:46,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:15:46,940 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 603 transitions.
[2024-02-28 17:15:46,941 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5207253886010362
[2024-02-28 17:15:46,941 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 603 transitions.
[2024-02-28 17:15:46,942 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 603 transitions.
[2024-02-28 17:15:46,942 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:15:46,942 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 603 transitions.
[2024-02-28 17:15:46,945 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:46,947 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:46,948 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:46,948 INFO  L175             Difference]: Start difference. First operand has 52 places, 49 transitions, 106 flow. Second operand 6 states and 603 transitions.
[2024-02-28 17:15:46,948 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 102 transitions, 395 flow
[2024-02-28 17:15:46,949 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:15:46,951 INFO  L231             Difference]: Finished difference. Result has 62 places, 78 transitions, 326 flow
[2024-02-28 17:15:46,951 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=62, PETRI_TRANSITIONS=78}
[2024-02-28 17:15:46,951 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places.
[2024-02-28 17:15:46,951 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 326 flow
[2024-02-28 17:15:46,952 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:46,952 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:15:46,952 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:15:46,952 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 17:15:46,952 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:15:46,953 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:15:46,953 INFO  L85        PathProgramCache]: Analyzing trace with hash 1573274442, now seen corresponding path program 1 times
[2024-02-28 17:15:46,953 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:15:46,953 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074787902]
[2024-02-28 17:15:46,953 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:15:46,953 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:15:46,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:15:46,978 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:15:46,979 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:15:46,979 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074787902]
[2024-02-28 17:15:46,979 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074787902] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:15:46,979 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:15:46,979 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:15:46,979 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423907065]
[2024-02-28 17:15:46,979 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:15:46,980 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:15:46,980 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:15:46,980 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:15:46,980 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:15:46,988 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 193
[2024-02-28 17:15:46,989 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 326 flow. Second operand  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:46,989 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:15:46,989 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 193
[2024-02-28 17:15:46,989 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:15:47,048 INFO  L130       PetriNetUnfolder]: 122/485 cut-off events.
[2024-02-28 17:15:47,048 INFO  L131       PetriNetUnfolder]: For 111/116 co-relation queries the response was YES.
[2024-02-28 17:15:47,050 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 485 events. 122/485 cut-off events. For 111/116 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2711 event pairs, 10 based on Foata normal form. 11/468 useless extension candidates. Maximal degree in co-relation 1076. Up to 129 conditions per place. 
[2024-02-28 17:15:47,051 INFO  L137   encePairwiseOnDemand]: 189/193 looper letters, 24 selfloop transitions, 2 changer transitions 0/84 dead transitions.
[2024-02-28 17:15:47,051 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 392 flow
[2024-02-28 17:15:47,052 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:15:47,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:15:47,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions.
[2024-02-28 17:15:47,053 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5785837651122625
[2024-02-28 17:15:47,053 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 335 transitions.
[2024-02-28 17:15:47,053 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions.
[2024-02-28 17:15:47,053 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:15:47,053 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions.
[2024-02-28 17:15:47,054 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:47,056 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:47,056 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:47,056 INFO  L175             Difference]: Start difference. First operand has 62 places, 78 transitions, 326 flow. Second operand 3 states and 335 transitions.
[2024-02-28 17:15:47,056 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 392 flow
[2024-02-28 17:15:47,060 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:15:47,061 INFO  L231             Difference]: Finished difference. Result has 63 places, 78 transitions, 336 flow
[2024-02-28 17:15:47,061 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=63, PETRI_TRANSITIONS=78}
[2024-02-28 17:15:47,061 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2024-02-28 17:15:47,062 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 336 flow
[2024-02-28 17:15:47,062 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:47,062 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:15:47,062 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:15:47,062 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 17:15:47,062 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:15:47,063 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:15:47,063 INFO  L85        PathProgramCache]: Analyzing trace with hash 348753171, now seen corresponding path program 1 times
[2024-02-28 17:15:47,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:15:47,063 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437347462]
[2024-02-28 17:15:47,063 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:15:47,063 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:15:47,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:15:47,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:15:47,261 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:15:47,261 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437347462]
[2024-02-28 17:15:47,261 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437347462] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:15:47,261 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:15:47,262 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:15:47,262 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044461886]
[2024-02-28 17:15:47,262 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:15:47,262 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:15:47,262 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:15:47,262 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:15:47,263 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:15:47,430 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 193
[2024-02-28 17:15:47,431 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 336 flow. Second operand  has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:47,431 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:15:47,431 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 193
[2024-02-28 17:15:47,431 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:15:47,552 INFO  L130       PetriNetUnfolder]: 228/682 cut-off events.
[2024-02-28 17:15:47,553 INFO  L131       PetriNetUnfolder]: For 296/304 co-relation queries the response was YES.
[2024-02-28 17:15:47,554 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 682 events. 228/682 cut-off events. For 296/304 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3726 event pairs, 57 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 1748. Up to 360 conditions per place. 
[2024-02-28 17:15:47,556 INFO  L137   encePairwiseOnDemand]: 182/193 looper letters, 52 selfloop transitions, 33 changer transitions 8/128 dead transitions.
[2024-02-28 17:15:47,556 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 128 transitions, 725 flow
[2024-02-28 17:15:47,557 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:15:47,557 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:15:47,558 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions.
[2024-02-28 17:15:47,558 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5483592400690847
[2024-02-28 17:15:47,558 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 635 transitions.
[2024-02-28 17:15:47,558 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions.
[2024-02-28 17:15:47,559 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:15:47,559 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions.
[2024-02-28 17:15:47,560 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:47,562 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:47,563 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:47,563 INFO  L175             Difference]: Start difference. First operand has 63 places, 78 transitions, 336 flow. Second operand 6 states and 635 transitions.
[2024-02-28 17:15:47,563 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 128 transitions, 725 flow
[2024-02-28 17:15:47,566 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 128 transitions, 725 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:15:47,568 INFO  L231             Difference]: Finished difference. Result has 73 places, 108 transitions, 637 flow
[2024-02-28 17:15:47,568 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=637, PETRI_PLACES=73, PETRI_TRANSITIONS=108}
[2024-02-28 17:15:47,569 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2024-02-28 17:15:47,569 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 108 transitions, 637 flow
[2024-02-28 17:15:47,569 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:47,569 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:15:47,569 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:15:47,570 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 17:15:47,570 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:15:47,570 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:15:47,570 INFO  L85        PathProgramCache]: Analyzing trace with hash -1543790880, now seen corresponding path program 1 times
[2024-02-28 17:15:47,570 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:15:47,570 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444134684]
[2024-02-28 17:15:47,570 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:15:47,570 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:15:47,585 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:15:47,789 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:15:47,789 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:15:47,790 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444134684]
[2024-02-28 17:15:47,790 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444134684] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:15:47,790 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:15:47,790 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:15:47,790 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281256789]
[2024-02-28 17:15:47,790 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:15:47,790 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:15:47,791 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:15:47,791 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:15:47,791 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:15:47,905 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 193
[2024-02-28 17:15:47,905 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 108 transitions, 637 flow. Second operand  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:47,905 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:15:47,906 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 193
[2024-02-28 17:15:47,906 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:15:48,237 INFO  L130       PetriNetUnfolder]: 402/1014 cut-off events.
[2024-02-28 17:15:48,238 INFO  L131       PetriNetUnfolder]: For 761/769 co-relation queries the response was YES.
[2024-02-28 17:15:48,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 1014 events. 402/1014 cut-off events. For 761/769 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6010 event pairs, 103 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 3282. Up to 729 conditions per place. 
[2024-02-28 17:15:48,242 INFO  L137   encePairwiseOnDemand]: 171/193 looper letters, 105 selfloop transitions, 76 changer transitions 24/218 dead transitions.
[2024-02-28 17:15:48,242 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 218 transitions, 1523 flow
[2024-02-28 17:15:48,243 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:15:48,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:15:48,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions.
[2024-02-28 17:15:48,244 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5474956822107081
[2024-02-28 17:15:48,244 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 634 transitions.
[2024-02-28 17:15:48,244 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 634 transitions.
[2024-02-28 17:15:48,245 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:15:48,245 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 634 transitions.
[2024-02-28 17:15:48,246 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:48,248 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:48,248 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:48,248 INFO  L175             Difference]: Start difference. First operand has 73 places, 108 transitions, 637 flow. Second operand 6 states and 634 transitions.
[2024-02-28 17:15:48,248 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 218 transitions, 1523 flow
[2024-02-28 17:15:48,253 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 218 transitions, 1523 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:15:48,255 INFO  L231             Difference]: Finished difference. Result has 81 places, 174 transitions, 1228 flow
[2024-02-28 17:15:48,255 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1228, PETRI_PLACES=81, PETRI_TRANSITIONS=174}
[2024-02-28 17:15:48,256 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places.
[2024-02-28 17:15:48,256 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 174 transitions, 1228 flow
[2024-02-28 17:15:48,256 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:48,256 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:15:48,256 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-02-28 17:15:48,256 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-02-28 17:15:48,257 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:15:48,257 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:15:48,257 INFO  L85        PathProgramCache]: Analyzing trace with hash -1557923308, now seen corresponding path program 1 times
[2024-02-28 17:15:48,257 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:15:48,257 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705403628]
[2024-02-28 17:15:48,257 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:15:48,257 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:15:48,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:15:48,286 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 17:15:48,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:15:48,312 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 17:15:48,312 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 17:15:48,313 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2024-02-28 17:15:48,315 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2024-02-28 17:15:48,315 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2024-02-28 17:15:48,315 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2024-02-28 17:15:48,315 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2024-02-28 17:15:48,315 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2024-02-28 17:15:48,315 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2024-02-28 17:15:48,315 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2024-02-28 17:15:48,315 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2024-02-28 17:15:48,316 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2024-02-28 17:15:48,316 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2024-02-28 17:15:48,316 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-02-28 17:15:48,316 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-02-28 17:15:48,318 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 17:15:48,318 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-02-28 17:15:48,334 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-02-28 17:15:48,337 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow
[2024-02-28 17:15:48,353 INFO  L130       PetriNetUnfolder]: 11/289 cut-off events.
[2024-02-28 17:15:48,353 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-02-28 17:15:48,354 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 303 conditions, 289 events. 11/289 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 710 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 167. Up to 8 conditions per place. 
[2024-02-28 17:15:48,354 INFO  L82        GeneralOperation]: Start removeDead. Operand has 135 places, 135 transitions, 288 flow
[2024-02-28 17:15:48,355 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 135 places, 135 transitions, 288 flow
[2024-02-28 17:15:48,355 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 17:15:48,355 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 135 transitions, 288 flow
[2024-02-28 17:15:48,355 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 135 transitions, 288 flow
[2024-02-28 17:15:48,355 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow
[2024-02-28 17:15:48,371 INFO  L130       PetriNetUnfolder]: 11/289 cut-off events.
[2024-02-28 17:15:48,371 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-02-28 17:15:48,372 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 303 conditions, 289 events. 11/289 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 710 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 167. Up to 8 conditions per place. 
[2024-02-28 17:15:48,374 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5220
[2024-02-28 17:15:50,101 INFO  L134        LiptonReduction]: Checked pairs total: 30411
[2024-02-28 17:15:50,102 INFO  L136        LiptonReduction]: Total number of compositions: 82
[2024-02-28 17:15:50,103 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 17:15:50,104 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59fcf406, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 17:15:50,104 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2024-02-28 17:15:50,105 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2024-02-28 17:15:50,105 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 17:15:50,105 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:15:50,105 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-02-28 17:15:50,105 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:15:50,105 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:15:50,105 INFO  L85        PathProgramCache]: Analyzing trace with hash 617, now seen corresponding path program 1 times
[2024-02-28 17:15:50,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:15:50,105 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536547880]
[2024-02-28 17:15:50,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:15:50,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:15:50,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:15:50,109 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:15:50,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:15:50,109 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536547880]
[2024-02-28 17:15:50,110 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536547880] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:15:50,110 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:15:50,110 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-02-28 17:15:50,110 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359978571]
[2024-02-28 17:15:50,110 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:15:50,110 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-02-28 17:15:50,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:15:50,110 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-02-28 17:15:50,110 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-02-28 17:15:50,111 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 217
[2024-02-28 17:15:50,111 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 146 flow. Second operand  has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:50,111 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:15:50,111 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 217
[2024-02-28 17:15:50,111 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:15:50,213 INFO  L130       PetriNetUnfolder]: 411/1257 cut-off events.
[2024-02-28 17:15:50,213 INFO  L131       PetriNetUnfolder]: For 71/158 co-relation queries the response was YES.
[2024-02-28 17:15:50,214 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 1257 events. 411/1257 cut-off events. For 71/158 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8092 event pairs, 404 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 1664. Up to 731 conditions per place. 
[2024-02-28 17:15:50,218 INFO  L137   encePairwiseOnDemand]: 216/217 looper letters, 22 selfloop transitions, 0 changer transitions 0/63 dead transitions.
[2024-02-28 17:15:50,218 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 188 flow
[2024-02-28 17:15:50,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-02-28 17:15:50,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-02-28 17:15:50,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 279 transitions.
[2024-02-28 17:15:50,220 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6428571428571429
[2024-02-28 17:15:50,220 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 279 transitions.
[2024-02-28 17:15:50,220 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 279 transitions.
[2024-02-28 17:15:50,220 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:15:50,220 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 279 transitions.
[2024-02-28 17:15:50,220 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 139.5) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:50,221 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:50,221 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:50,221 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 2 states and 279 transitions.
[2024-02-28 17:15:50,222 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 188 flow
[2024-02-28 17:15:50,222 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:15:50,223 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 144 flow
[2024-02-28 17:15:50,223 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=63}
[2024-02-28 17:15:50,224 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places.
[2024-02-28 17:15:50,224 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 144 flow
[2024-02-28 17:15:50,224 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:50,224 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:15:50,224 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:15:50,224 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-02-28 17:15:50,224 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:15:50,225 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:15:50,225 INFO  L85        PathProgramCache]: Analyzing trace with hash -1578260816, now seen corresponding path program 1 times
[2024-02-28 17:15:50,225 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:15:50,225 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986744121]
[2024-02-28 17:15:50,225 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:15:50,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:15:50,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:15:50,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:15:50,352 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:15:50,352 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986744121]
[2024-02-28 17:15:50,352 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986744121] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:15:50,353 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:15:50,353 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:15:50,353 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975814788]
[2024-02-28 17:15:50,353 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:15:50,353 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:15:50,353 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:15:50,354 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:15:50,354 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:15:50,538 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 217
[2024-02-28 17:15:50,539 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 144 flow. Second operand  has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:50,539 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:15:50,539 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 217
[2024-02-28 17:15:50,539 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:15:51,477 INFO  L130       PetriNetUnfolder]: 5742/10965 cut-off events.
[2024-02-28 17:15:51,477 INFO  L131       PetriNetUnfolder]: For 239/274 co-relation queries the response was YES.
[2024-02-28 17:15:51,485 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20646 conditions, 10965 events. 5742/10965 cut-off events. For 239/274 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 81958 event pairs, 1527 based on Foata normal form. 16/10301 useless extension candidates. Maximal degree in co-relation 20641. Up to 5895 conditions per place. 
[2024-02-28 17:15:51,521 INFO  L137   encePairwiseOnDemand]: 190/217 looper letters, 93 selfloop transitions, 48 changer transitions 0/158 dead transitions.
[2024-02-28 17:15:51,522 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 158 transitions, 627 flow
[2024-02-28 17:15:51,522 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:15:51,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:15:51,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions.
[2024-02-28 17:15:51,524 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5668202764976958
[2024-02-28 17:15:51,525 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 738 transitions.
[2024-02-28 17:15:51,525 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions.
[2024-02-28 17:15:51,525 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:15:51,525 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions.
[2024-02-28 17:15:51,526 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:51,528 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:51,529 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:51,529 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 144 flow. Second operand 6 states and 738 transitions.
[2024-02-28 17:15:51,529 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 158 transitions, 627 flow
[2024-02-28 17:15:51,531 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 158 transitions, 627 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:15:51,532 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 486 flow
[2024-02-28 17:15:51,533 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2024-02-28 17:15:51,533 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2024-02-28 17:15:51,533 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 486 flow
[2024-02-28 17:15:51,534 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:51,534 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:15:51,534 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:15:51,534 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-02-28 17:15:51,534 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:15:51,534 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:15:51,534 INFO  L85        PathProgramCache]: Analyzing trace with hash 933296301, now seen corresponding path program 1 times
[2024-02-28 17:15:51,534 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:15:51,534 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743609885]
[2024-02-28 17:15:51,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:15:51,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:15:51,542 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:15:51,553 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:15:51,553 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:15:51,553 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743609885]
[2024-02-28 17:15:51,553 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743609885] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:15:51,553 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:15:51,553 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:15:51,553 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677750592]
[2024-02-28 17:15:51,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:15:51,554 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:15:51,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:15:51,554 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:15:51,554 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:15:51,563 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217
[2024-02-28 17:15:51,563 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 486 flow. Second operand  has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:51,563 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:15:51,563 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217
[2024-02-28 17:15:51,563 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:15:51,962 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_71| v_~datas~0.base_81)) (.cse1 (* v_threadThread1of2ForFork0_~i~0_29 4))) (and (= |v_threadThread1of2ForFork0_#t~nondet4_30| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_71))) (= |v_threadThread1of2ForFork0_#t~nondet4_30| (select .cse0 (+ .cse1 v_~datas~0.offset_71))) (= (select .cse0 (+ .cse1 v_~datas~0.offset_71 1)) |v_threadThread1of2ForFork0_#t~nondet4_30|) (= |v_threadThread1of2ForFork0_#res.offset_9| 0) (= |v_threadThread1of2ForFork0_#res.base_9| 0) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_71)) |v_threadThread1of2ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_71|, ~datas~0.base=v_~datas~0.base_81, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_29, ~datas~0.offset=v_~datas~0.offset_71, threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_30|}  OutVars{#race=|v_#race_71|, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_9|, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_9|, threadThread1of2ForFork0_#t~nondet3=|v_threadThread1of2ForFork0_#t~nondet3_17|, ~datas~0.base=v_~datas~0.base_81, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_29, ~datas~0.offset=v_~datas~0.offset_71}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_#t~nondet3, threadThread1of2ForFork0_#t~nondet4][58], [Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 141#true, 2#ULTIMATE.startEXITtrue, Black: 143#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 144#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 138#true, threadThread2of2ForFork0InUse, 47#threadEXITtrue, 21#L1016-4true, 155#(= |#race~datas~0| 0)])
[2024-02-28 17:15:51,963 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2024-02-28 17:15:51,963 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:15:51,963 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:15:51,963 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:15:51,963 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L1016-4-->L1016-6: Formula: (= (store |v_#race_60| v_~datas~0.base_57 (store (select |v_#race_60| v_~datas~0.base_57) (+ (* v_threadThread2of2ForFork0_~i~0_19 4) v_~datas~0.offset_51) |v_threadThread2of2ForFork0_#t~nondet4_21|)) |v_#race_59|)  InVars {#race=|v_#race_60|, ~datas~0.base=v_~datas~0.base_57, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_19}  OutVars{#race=|v_#race_59|, ~datas~0.base=v_~datas~0.base_57, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_21|, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_19}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][91], [Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 2#ULTIMATE.startEXITtrue, 141#true, Black: 143#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 138#true, Black: 144#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 123#L1016-6true, 64#L1016-9true, 155#(= |#race~datas~0| 0)])
[2024-02-28 17:15:51,963 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2024-02-28 17:15:51,963 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:15:51,963 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:15:51,963 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:15:52,044 INFO  L130       PetriNetUnfolder]: 2751/6463 cut-off events.
[2024-02-28 17:15:52,044 INFO  L131       PetriNetUnfolder]: For 1904/2456 co-relation queries the response was YES.
[2024-02-28 17:15:52,053 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14861 conditions, 6463 events. 2751/6463 cut-off events. For 1904/2456 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 53231 event pairs, 924 based on Foata normal form. 125/6164 useless extension candidates. Maximal degree in co-relation 14851. Up to 2371 conditions per place. 
[2024-02-28 17:15:52,071 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 36 selfloop transitions, 3 changer transitions 0/118 dead transitions.
[2024-02-28 17:15:52,072 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 585 flow
[2024-02-28 17:15:52,072 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:15:52,072 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:15:52,073 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions.
[2024-02-28 17:15:52,073 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5990783410138248
[2024-02-28 17:15:52,073 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 390 transitions.
[2024-02-28 17:15:52,073 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions.
[2024-02-28 17:15:52,074 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:15:52,074 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions.
[2024-02-28 17:15:52,075 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:52,076 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:52,076 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:52,076 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 486 flow. Second operand 3 states and 390 transitions.
[2024-02-28 17:15:52,076 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 585 flow
[2024-02-28 17:15:52,084 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:15:52,086 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 501 flow
[2024-02-28 17:15:52,086 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2024-02-28 17:15:52,086 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2024-02-28 17:15:52,086 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 501 flow
[2024-02-28 17:15:52,087 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:52,087 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:15:52,087 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:15:52,087 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-02-28 17:15:52,087 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:15:52,087 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:15:52,087 INFO  L85        PathProgramCache]: Analyzing trace with hash -2101318696, now seen corresponding path program 1 times
[2024-02-28 17:15:52,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:15:52,087 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181433701]
[2024-02-28 17:15:52,087 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:15:52,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:15:52,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:15:52,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:15:52,254 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:15:52,254 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181433701]
[2024-02-28 17:15:52,254 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181433701] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:15:52,254 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:15:52,254 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:15:52,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118951587]
[2024-02-28 17:15:52,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:15:52,255 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:15:52,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:15:52,255 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:15:52,255 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:15:52,424 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217
[2024-02-28 17:15:52,425 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 501 flow. Second operand  has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:52,425 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:15:52,425 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217
[2024-02-28 17:15:52,426 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:15:53,498 INFO  L130       PetriNetUnfolder]: 5675/10752 cut-off events.
[2024-02-28 17:15:53,498 INFO  L131       PetriNetUnfolder]: For 6509/6607 co-relation queries the response was YES.
[2024-02-28 17:15:53,513 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28674 conditions, 10752 events. 5675/10752 cut-off events. For 6509/6607 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 79142 event pairs, 1877 based on Foata normal form. 0/10235 useless extension candidates. Maximal degree in co-relation 28663. Up to 6983 conditions per place. 
[2024-02-28 17:15:53,539 INFO  L137   encePairwiseOnDemand]: 202/217 looper letters, 110 selfloop transitions, 70 changer transitions 0/218 dead transitions.
[2024-02-28 17:15:53,540 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 218 transitions, 1313 flow
[2024-02-28 17:15:53,541 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:15:53,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:15:53,542 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions.
[2024-02-28 17:15:53,542 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5821812596006144
[2024-02-28 17:15:53,543 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 758 transitions.
[2024-02-28 17:15:53,543 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 758 transitions.
[2024-02-28 17:15:53,543 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:15:53,543 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 758 transitions.
[2024-02-28 17:15:53,544 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:53,546 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:53,546 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:53,546 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 501 flow. Second operand 6 states and 758 transitions.
[2024-02-28 17:15:53,546 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 218 transitions, 1313 flow
[2024-02-28 17:15:53,554 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 218 transitions, 1313 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:15:53,556 INFO  L231             Difference]: Finished difference. Result has 87 places, 180 transitions, 1155 flow
[2024-02-28 17:15:53,556 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1155, PETRI_PLACES=87, PETRI_TRANSITIONS=180}
[2024-02-28 17:15:53,556 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places.
[2024-02-28 17:15:53,556 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 180 transitions, 1155 flow
[2024-02-28 17:15:53,557 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:53,557 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:15:53,557 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:15:53,557 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-02-28 17:15:53,557 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:15:53,557 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:15:53,557 INFO  L85        PathProgramCache]: Analyzing trace with hash 1490734773, now seen corresponding path program 1 times
[2024-02-28 17:15:53,557 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:15:53,558 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878618611]
[2024-02-28 17:15:53,558 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:15:53,558 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:15:53,575 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:15:53,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:15:53,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:15:53,718 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878618611]
[2024-02-28 17:15:53,718 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878618611] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:15:53,718 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:15:53,718 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:15:53,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144800787]
[2024-02-28 17:15:53,719 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:15:53,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:15:53,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:15:53,719 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:15:53,719 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:15:53,878 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2024-02-28 17:15:53,879 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 180 transitions, 1155 flow. Second operand  has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:53,879 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:15:53,879 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2024-02-28 17:15:53,879 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:15:55,878 INFO  L130       PetriNetUnfolder]: 11355/20109 cut-off events.
[2024-02-28 17:15:55,878 INFO  L131       PetriNetUnfolder]: For 18604/18765 co-relation queries the response was YES.
[2024-02-28 17:15:55,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64116 conditions, 20109 events. 11355/20109 cut-off events. For 18604/18765 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 151214 event pairs, 3272 based on Foata normal form. 0/18815 useless extension candidates. Maximal degree in co-relation 64100. Up to 13848 conditions per place. 
[2024-02-28 17:15:55,956 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 239 selfloop transitions, 132 changer transitions 0/389 dead transitions.
[2024-02-28 17:15:55,956 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 389 transitions, 2939 flow
[2024-02-28 17:15:55,957 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:15:55,957 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:15:55,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions.
[2024-02-28 17:15:55,959 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975422427035331
[2024-02-28 17:15:55,959 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 778 transitions.
[2024-02-28 17:15:55,959 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions.
[2024-02-28 17:15:55,959 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:15:55,959 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions.
[2024-02-28 17:15:55,961 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:55,962 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:55,963 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:55,963 INFO  L175             Difference]: Start difference. First operand has 87 places, 180 transitions, 1155 flow. Second operand 6 states and 778 transitions.
[2024-02-28 17:15:55,963 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 389 transitions, 2939 flow
[2024-02-28 17:15:55,989 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 389 transitions, 2939 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:15:55,992 INFO  L231             Difference]: Finished difference. Result has 96 places, 302 transitions, 2326 flow
[2024-02-28 17:15:55,993 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2326, PETRI_PLACES=96, PETRI_TRANSITIONS=302}
[2024-02-28 17:15:55,993 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 29 predicate places.
[2024-02-28 17:15:55,993 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 302 transitions, 2326 flow
[2024-02-28 17:15:55,994 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:55,994 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:15:55,994 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:15:55,994 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-02-28 17:15:55,994 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:15:55,994 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:15:55,994 INFO  L85        PathProgramCache]: Analyzing trace with hash -686777030, now seen corresponding path program 1 times
[2024-02-28 17:15:55,994 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:15:55,994 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407760250]
[2024-02-28 17:15:55,994 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:15:55,995 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:15:56,009 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:15:56,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-02-28 17:15:56,223 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:15:56,223 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407760250]
[2024-02-28 17:15:56,223 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407760250] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:15:56,224 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057083741]
[2024-02-28 17:15:56,224 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:15:56,224 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:15:56,224 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:15:56,226 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:15:56,233 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-02-28 17:15:56,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:15:56,323 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2024-02-28 17:15:56,327 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:15:56,443 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:15:56,469 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:15:56,470 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 17:15:56,500 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:15:56,501 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:15:56,502 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 17:15:56,546 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:15:56,546 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:15:56,547 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:15:56,548 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 17:15:56,592 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:15:56,593 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 17:15:56,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-02-28 17:15:56,622 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:15:56,656 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-02-28 17:15:56,682 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2024-02-28 17:15:56,706 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2024-02-28 17:15:56,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2024-02-28 17:15:56,766 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057083741] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:15:56,766 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:15:56,766 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15
[2024-02-28 17:15:56,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317459989]
[2024-02-28 17:15:56,766 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:15:56,767 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-02-28 17:15:56,767 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:15:56,767 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-02-28 17:15:56,767 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=121, Unknown=3, NotChecked=78, Total=272
[2024-02-28 17:15:56,773 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 217
[2024-02-28 17:15:56,774 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 302 transitions, 2326 flow. Second operand  has 17 states, 17 states have (on average 81.3529411764706) internal successors, (1383), 17 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:15:56,774 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:15:56,774 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 217
[2024-02-28 17:15:56,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:15:59,904 INFO  L130       PetriNetUnfolder]: 14603/24245 cut-off events.
[2024-02-28 17:15:59,904 INFO  L131       PetriNetUnfolder]: For 41050/41050 co-relation queries the response was YES.
[2024-02-28 17:15:59,962 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94260 conditions, 24245 events. 14603/24245 cut-off events. For 41050/41050 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 173289 event pairs, 3234 based on Foata normal form. 162/22857 useless extension candidates. Maximal degree in co-relation 94239. Up to 14161 conditions per place. 
[2024-02-28 17:16:00,041 INFO  L137   encePairwiseOnDemand]: 207/217 looper letters, 500 selfloop transitions, 54 changer transitions 1/562 dead transitions.
[2024-02-28 17:16:00,041 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 562 transitions, 5374 flow
[2024-02-28 17:16:00,042 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 17:16:00,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 17:16:00,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 699 transitions.
[2024-02-28 17:16:00,044 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.46017116524028967
[2024-02-28 17:16:00,044 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 699 transitions.
[2024-02-28 17:16:00,044 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 699 transitions.
[2024-02-28 17:16:00,045 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:16:00,045 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 699 transitions.
[2024-02-28 17:16:00,046 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:00,048 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:00,048 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:00,048 INFO  L175             Difference]: Start difference. First operand has 96 places, 302 transitions, 2326 flow. Second operand 7 states and 699 transitions.
[2024-02-28 17:16:00,049 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 562 transitions, 5374 flow
[2024-02-28 17:16:00,274 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 562 transitions, 5278 flow, removed 48 selfloop flow, removed 0 redundant places.
[2024-02-28 17:16:00,280 INFO  L231             Difference]: Finished difference. Result has 102 places, 314 transitions, 2506 flow
[2024-02-28 17:16:00,281 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2506, PETRI_PLACES=102, PETRI_TRANSITIONS=314}
[2024-02-28 17:16:00,282 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 35 predicate places.
[2024-02-28 17:16:00,282 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 314 transitions, 2506 flow
[2024-02-28 17:16:00,282 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 81.3529411764706) internal successors, (1383), 17 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:00,283 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:16:00,283 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:16:00,335 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-02-28 17:16:00,484 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-02-28 17:16:00,486 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:16:00,486 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:16:00,486 INFO  L85        PathProgramCache]: Analyzing trace with hash -1154275821, now seen corresponding path program 1 times
[2024-02-28 17:16:00,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:16:00,487 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003638093]
[2024-02-28 17:16:00,487 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:16:00,487 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:16:00,510 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:16:00,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:16:00,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:16:00,744 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003638093]
[2024-02-28 17:16:00,744 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003638093] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:16:00,744 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:16:00,745 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-02-28 17:16:00,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094392957]
[2024-02-28 17:16:00,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:16:00,745 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-02-28 17:16:00,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:16:00,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-02-28 17:16:00,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-02-28 17:16:01,074 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 217
[2024-02-28 17:16:01,075 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 314 transitions, 2506 flow. Second operand  has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:01,075 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:16:01,075 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 217
[2024-02-28 17:16:01,075 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:16:03,840 INFO  L130       PetriNetUnfolder]: 13820/24388 cut-off events.
[2024-02-28 17:16:03,840 INFO  L131       PetriNetUnfolder]: For 46821/46988 co-relation queries the response was YES.
[2024-02-28 17:16:03,903 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 97397 conditions, 24388 events. 13820/24388 cut-off events. For 46821/46988 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 189768 event pairs, 3201 based on Foata normal form. 348/24232 useless extension candidates. Maximal degree in co-relation 97374. Up to 11426 conditions per place. 
[2024-02-28 17:16:03,980 INFO  L137   encePairwiseOnDemand]: 201/217 looper letters, 462 selfloop transitions, 166 changer transitions 2/647 dead transitions.
[2024-02-28 17:16:03,980 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 647 transitions, 6020 flow
[2024-02-28 17:16:03,981 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-02-28 17:16:03,981 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-02-28 17:16:03,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 973 transitions.
[2024-02-28 17:16:03,983 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5604838709677419
[2024-02-28 17:16:03,983 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 973 transitions.
[2024-02-28 17:16:03,983 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 973 transitions.
[2024-02-28 17:16:03,983 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:16:03,984 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 973 transitions.
[2024-02-28 17:16:03,985 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 121.625) internal successors, (973), 8 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:03,987 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:03,987 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:03,987 INFO  L175             Difference]: Start difference. First operand has 102 places, 314 transitions, 2506 flow. Second operand 8 states and 973 transitions.
[2024-02-28 17:16:03,987 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 647 transitions, 6020 flow
[2024-02-28 17:16:04,138 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 647 transitions, 5921 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-02-28 17:16:04,143 INFO  L231             Difference]: Finished difference. Result has 111 places, 430 transitions, 4113 flow
[2024-02-28 17:16:04,143 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2462, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4113, PETRI_PLACES=111, PETRI_TRANSITIONS=430}
[2024-02-28 17:16:04,144 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 44 predicate places.
[2024-02-28 17:16:04,144 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 430 transitions, 4113 flow
[2024-02-28 17:16:04,144 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:04,144 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:16:04,144 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:16:04,144 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-02-28 17:16:04,144 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:16:04,145 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:16:04,145 INFO  L85        PathProgramCache]: Analyzing trace with hash 340394548, now seen corresponding path program 1 times
[2024-02-28 17:16:04,145 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:16:04,145 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644745154]
[2024-02-28 17:16:04,145 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:16:04,145 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:16:04,156 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:16:04,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:16:04,194 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:16:04,194 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644745154]
[2024-02-28 17:16:04,194 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644745154] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:16:04,194 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515588580]
[2024-02-28 17:16:04,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:16:04,194 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:16:04,194 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:16:04,195 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:16:04,197 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-02-28 17:16:04,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:16:04,306 INFO  L263         TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-02-28 17:16:04,307 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:16:04,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:16:04,339 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:16:04,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:16:04,377 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [515588580] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:16:04,377 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:16:04,377 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2024-02-28 17:16:04,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516554793]
[2024-02-28 17:16:04,378 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:16:04,378 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-02-28 17:16:04,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:16:04,378 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-02-28 17:16:04,378 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-02-28 17:16:04,493 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217
[2024-02-28 17:16:04,494 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 430 transitions, 4113 flow. Second operand  has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:04,494 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:16:04,494 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217
[2024-02-28 17:16:04,494 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:16:05,897 INFO  L130       PetriNetUnfolder]: 5754/12879 cut-off events.
[2024-02-28 17:16:05,897 INFO  L131       PetriNetUnfolder]: For 42930/44884 co-relation queries the response was YES.
[2024-02-28 17:16:05,943 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55285 conditions, 12879 events. 5754/12879 cut-off events. For 42930/44884 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 112065 event pairs, 470 based on Foata normal form. 202/12746 useless extension candidates. Maximal degree in co-relation 55256. Up to 5114 conditions per place. 
[2024-02-28 17:16:05,987 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 152 selfloop transitions, 5 changer transitions 23/483 dead transitions.
[2024-02-28 17:16:05,987 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 483 transitions, 4821 flow
[2024-02-28 17:16:05,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 17:16:05,988 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 17:16:05,989 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions.
[2024-02-28 17:16:05,989 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5766951942067149
[2024-02-28 17:16:05,989 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 876 transitions.
[2024-02-28 17:16:05,989 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions.
[2024-02-28 17:16:05,990 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:16:05,990 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions.
[2024-02-28 17:16:05,991 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:05,993 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:05,993 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:05,993 INFO  L175             Difference]: Start difference. First operand has 111 places, 430 transitions, 4113 flow. Second operand 7 states and 876 transitions.
[2024-02-28 17:16:05,993 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 483 transitions, 4821 flow
[2024-02-28 17:16:06,150 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 483 transitions, 4807 flow, removed 7 selfloop flow, removed 0 redundant places.
[2024-02-28 17:16:06,155 INFO  L231             Difference]: Finished difference. Result has 120 places, 390 transitions, 3685 flow
[2024-02-28 17:16:06,155 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3757, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3685, PETRI_PLACES=120, PETRI_TRANSITIONS=390}
[2024-02-28 17:16:06,156 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 53 predicate places.
[2024-02-28 17:16:06,156 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 390 transitions, 3685 flow
[2024-02-28 17:16:06,156 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:06,156 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:16:06,157 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:16:06,162 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-02-28 17:16:06,362 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:16:06,362 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:16:06,363 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:16:06,363 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108254852, now seen corresponding path program 1 times
[2024-02-28 17:16:06,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:16:06,363 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435015317]
[2024-02-28 17:16:06,363 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:16:06,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:16:06,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:16:06,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:16:06,570 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:16:06,570 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435015317]
[2024-02-28 17:16:06,571 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435015317] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:16:06,571 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:16:06,571 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-02-28 17:16:06,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716840216]
[2024-02-28 17:16:06,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:16:06,571 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-02-28 17:16:06,571 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:16:06,571 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-02-28 17:16:06,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-02-28 17:16:06,889 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2024-02-28 17:16:06,890 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 390 transitions, 3685 flow. Second operand  has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:06,890 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:16:06,890 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2024-02-28 17:16:06,890 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:16:09,019 INFO  L130       PetriNetUnfolder]: 8771/16346 cut-off events.
[2024-02-28 17:16:09,019 INFO  L131       PetriNetUnfolder]: For 65828/66223 co-relation queries the response was YES.
[2024-02-28 17:16:09,079 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77526 conditions, 16346 events. 8771/16346 cut-off events. For 65828/66223 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 123686 event pairs, 2787 based on Foata normal form. 240/16416 useless extension candidates. Maximal degree in co-relation 77493. Up to 13560 conditions per place. 
[2024-02-28 17:16:09,147 INFO  L137   encePairwiseOnDemand]: 209/217 looper letters, 343 selfloop transitions, 13 changer transitions 7/402 dead transitions.
[2024-02-28 17:16:09,147 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 402 transitions, 4497 flow
[2024-02-28 17:16:09,148 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 17:16:09,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 17:16:09,149 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 742 transitions.
[2024-02-28 17:16:09,150 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48847926267281105
[2024-02-28 17:16:09,150 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 742 transitions.
[2024-02-28 17:16:09,150 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 742 transitions.
[2024-02-28 17:16:09,150 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:16:09,150 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 742 transitions.
[2024-02-28 17:16:09,152 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:09,153 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:09,154 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:09,154 INFO  L175             Difference]: Start difference. First operand has 120 places, 390 transitions, 3685 flow. Second operand 7 states and 742 transitions.
[2024-02-28 17:16:09,154 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 402 transitions, 4497 flow
[2024-02-28 17:16:09,363 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 402 transitions, 4408 flow, removed 6 selfloop flow, removed 3 redundant places.
[2024-02-28 17:16:09,368 INFO  L231             Difference]: Finished difference. Result has 122 places, 388 transitions, 3635 flow
[2024-02-28 17:16:09,368 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3592, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3635, PETRI_PLACES=122, PETRI_TRANSITIONS=388}
[2024-02-28 17:16:09,369 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 55 predicate places.
[2024-02-28 17:16:09,369 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 388 transitions, 3635 flow
[2024-02-28 17:16:09,370 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:09,370 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:16:09,370 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:16:09,370 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-02-28 17:16:09,370 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:16:09,370 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:16:09,370 INFO  L85        PathProgramCache]: Analyzing trace with hash 860099489, now seen corresponding path program 1 times
[2024-02-28 17:16:09,370 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:16:09,370 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949456048]
[2024-02-28 17:16:09,371 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:16:09,371 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:16:09,386 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:16:09,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-02-28 17:16:09,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:16:09,548 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949456048]
[2024-02-28 17:16:09,548 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949456048] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:16:09,548 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:16:09,548 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:16:09,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544867585]
[2024-02-28 17:16:09,548 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:16:09,549 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:16:09,549 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:16:09,549 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:16:09,549 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:16:09,689 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2024-02-28 17:16:09,690 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 388 transitions, 3635 flow. Second operand  has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:09,690 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:16:09,690 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2024-02-28 17:16:09,690 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:16:12,700 INFO  L130       PetriNetUnfolder]: 12785/22892 cut-off events.
[2024-02-28 17:16:12,700 INFO  L131       PetriNetUnfolder]: For 82261/82659 co-relation queries the response was YES.
[2024-02-28 17:16:12,793 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105773 conditions, 22892 events. 12785/22892 cut-off events. For 82261/82659 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 175825 event pairs, 2816 based on Foata normal form. 45/21734 useless extension candidates. Maximal degree in co-relation 105739. Up to 17260 conditions per place. 
[2024-02-28 17:16:12,886 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 405 selfloop transitions, 156 changer transitions 18/594 dead transitions.
[2024-02-28 17:16:12,887 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 594 transitions, 6405 flow
[2024-02-28 17:16:12,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:16:12,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:16:12,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions.
[2024-02-28 17:16:12,889 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975422427035331
[2024-02-28 17:16:12,889 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 778 transitions.
[2024-02-28 17:16:12,889 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions.
[2024-02-28 17:16:12,890 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:16:12,890 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions.
[2024-02-28 17:16:12,891 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:12,892 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:12,893 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:12,893 INFO  L175             Difference]: Start difference. First operand has 122 places, 388 transitions, 3635 flow. Second operand 6 states and 778 transitions.
[2024-02-28 17:16:12,893 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 594 transitions, 6405 flow
[2024-02-28 17:16:13,208 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 594 transitions, 6347 flow, removed 1 selfloop flow, removed 3 redundant places.
[2024-02-28 17:16:13,214 INFO  L231             Difference]: Finished difference. Result has 128 places, 501 transitions, 5166 flow
[2024-02-28 17:16:13,215 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3601, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5166, PETRI_PLACES=128, PETRI_TRANSITIONS=501}
[2024-02-28 17:16:13,215 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 61 predicate places.
[2024-02-28 17:16:13,215 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 501 transitions, 5166 flow
[2024-02-28 17:16:13,216 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:13,216 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:16:13,216 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:16:13,216 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-02-28 17:16:13,216 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:16:13,216 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:16:13,216 INFO  L85        PathProgramCache]: Analyzing trace with hash -907237555, now seen corresponding path program 1 times
[2024-02-28 17:16:13,216 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:16:13,216 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486945864]
[2024-02-28 17:16:13,216 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:16:13,217 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:16:13,235 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:16:14,143 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:16:14,143 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:16:14,143 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486945864]
[2024-02-28 17:16:14,143 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486945864] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:16:14,143 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289276538]
[2024-02-28 17:16:14,143 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:16:14,144 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:16:14,144 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:16:14,145 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:16:14,145 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-02-28 17:16:14,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:16:14,245 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core
[2024-02-28 17:16:14,249 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:16:14,263 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2024-02-28 17:16:14,376 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:16:14,376 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-02-28 17:16:14,419 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-02-28 17:16:14,435 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 17:16:14,554 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 17:16:14,578 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 17:16:14,609 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:16:14,609 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 17:16:14,645 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:16:14,645 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 17:16:14,691 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:16:14,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:16:14,700 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:16:14,700 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [289276538] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:16:14,700 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 17:16:14,700 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21
[2024-02-28 17:16:14,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039818425]
[2024-02-28 17:16:14,701 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:16:14,701 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-02-28 17:16:14,701 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:16:14,701 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-02-28 17:16:14,701 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506
[2024-02-28 17:16:15,024 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217
[2024-02-28 17:16:15,025 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 501 transitions, 5166 flow. Second operand  has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:15,025 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:16:15,025 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217
[2024-02-28 17:16:15,025 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:16:19,953 INFO  L130       PetriNetUnfolder]: 16066/28224 cut-off events.
[2024-02-28 17:16:19,953 INFO  L131       PetriNetUnfolder]: For 138124/138543 co-relation queries the response was YES.
[2024-02-28 17:16:20,076 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 145503 conditions, 28224 events. 16066/28224 cut-off events. For 138124/138543 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 221081 event pairs, 2413 based on Foata normal form. 232/28257 useless extension candidates. Maximal degree in co-relation 145465. Up to 10206 conditions per place. 
[2024-02-28 17:16:20,181 INFO  L137   encePairwiseOnDemand]: 201/217 looper letters, 933 selfloop transitions, 283 changer transitions 35/1263 dead transitions.
[2024-02-28 17:16:20,181 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 1263 transitions, 15728 flow
[2024-02-28 17:16:20,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-02-28 17:16:20,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-02-28 17:16:20,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1167 transitions.
[2024-02-28 17:16:20,188 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48889819857561795
[2024-02-28 17:16:20,188 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1167 transitions.
[2024-02-28 17:16:20,188 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1167 transitions.
[2024-02-28 17:16:20,189 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:16:20,189 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1167 transitions.
[2024-02-28 17:16:20,193 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 106.0909090909091) internal successors, (1167), 11 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:20,197 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:20,198 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:20,198 INFO  L175             Difference]: Start difference. First operand has 128 places, 501 transitions, 5166 flow. Second operand 11 states and 1167 transitions.
[2024-02-28 17:16:20,198 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 1263 transitions, 15728 flow
[2024-02-28 17:16:20,917 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 1263 transitions, 15478 flow, removed 125 selfloop flow, removed 0 redundant places.
[2024-02-28 17:16:20,929 INFO  L231             Difference]: Finished difference. Result has 145 places, 755 transitions, 9363 flow
[2024-02-28 17:16:20,929 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=5000, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9363, PETRI_PLACES=145, PETRI_TRANSITIONS=755}
[2024-02-28 17:16:20,929 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 78 predicate places.
[2024-02-28 17:16:20,930 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 755 transitions, 9363 flow
[2024-02-28 17:16:20,930 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:20,930 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:16:20,930 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:16:20,938 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-02-28 17:16:21,131 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-02-28 17:16:21,131 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:16:21,132 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:16:21,133 INFO  L85        PathProgramCache]: Analyzing trace with hash -103982335, now seen corresponding path program 2 times
[2024-02-28 17:16:21,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:16:21,134 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921623399]
[2024-02-28 17:16:21,134 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:16:21,134 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:16:21,155 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:16:21,600 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:16:21,601 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:16:21,601 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921623399]
[2024-02-28 17:16:21,601 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921623399] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:16:21,601 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173559234]
[2024-02-28 17:16:21,601 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 17:16:21,602 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:16:21,602 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:16:21,603 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:16:21,604 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-02-28 17:16:21,751 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 17:16:21,751 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:16:21,753 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core
[2024-02-28 17:16:21,758 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:16:21,767 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:16:21,771 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2024-02-28 17:16:21,889 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:16:21,889 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-02-28 17:16:21,926 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:16:21,927 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-02-28 17:16:21,942 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 17:16:21,988 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 17:16:22,043 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:16:22,044 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 17:16:22,135 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 17:16:22,175 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:16:22,176 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-02-28 17:16:22,200 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:16:22,200 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 17:16:22,258 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:16:22,259 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:16:22,278 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:16:22,282 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:16:22,314 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:16:22,315 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:16:22,353 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:16:22,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:16:22,362 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:16:22,363 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [173559234] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:16:22,363 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 17:16:22,363 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2024-02-28 17:16:22,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512048405]
[2024-02-28 17:16:22,364 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:16:22,364 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-02-28 17:16:22,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:16:22,365 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-02-28 17:16:22,365 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2024-02-28 17:16:22,983 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217
[2024-02-28 17:16:22,984 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 755 transitions, 9363 flow. Second operand  has 11 states, 11 states have (on average 91.18181818181819) internal successors, (1003), 11 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:22,984 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:16:22,984 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217
[2024-02-28 17:16:22,984 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:16:30,205 INFO  L130       PetriNetUnfolder]: 17180/30220 cut-off events.
[2024-02-28 17:16:30,205 INFO  L131       PetriNetUnfolder]: For 206398/206888 co-relation queries the response was YES.
[2024-02-28 17:16:30,337 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172995 conditions, 30220 events. 17180/30220 cut-off events. For 206398/206888 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 238311 event pairs, 2207 based on Foata normal form. 290/30331 useless extension candidates. Maximal degree in co-relation 172949. Up to 12901 conditions per place. 
[2024-02-28 17:16:30,523 INFO  L137   encePairwiseOnDemand]: 197/217 looper letters, 838 selfloop transitions, 526 changer transitions 51/1427 dead transitions.
[2024-02-28 17:16:30,523 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 1427 transitions, 19203 flow
[2024-02-28 17:16:30,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-02-28 17:16:30,524 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-02-28 17:16:30,526 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1651 transitions.
[2024-02-28 17:16:30,527 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5072196620583718
[2024-02-28 17:16:30,527 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1651 transitions.
[2024-02-28 17:16:30,527 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1651 transitions.
[2024-02-28 17:16:30,528 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:16:30,528 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1651 transitions.
[2024-02-28 17:16:30,531 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 110.06666666666666) internal successors, (1651), 15 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:30,534 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 217.0) internal successors, (3472), 16 states have internal predecessors, (3472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:30,534 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 217.0) internal successors, (3472), 16 states have internal predecessors, (3472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:30,534 INFO  L175             Difference]: Start difference. First operand has 145 places, 755 transitions, 9363 flow. Second operand 15 states and 1651 transitions.
[2024-02-28 17:16:30,535 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 1427 transitions, 19203 flow
[2024-02-28 17:16:31,978 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 1427 transitions, 19137 flow, removed 25 selfloop flow, removed 2 redundant places.
[2024-02-28 17:16:31,993 INFO  L231             Difference]: Finished difference. Result has 163 places, 999 transitions, 14370 flow
[2024-02-28 17:16:31,993 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=9322, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=14370, PETRI_PLACES=163, PETRI_TRANSITIONS=999}
[2024-02-28 17:16:31,994 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 96 predicate places.
[2024-02-28 17:16:31,994 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 999 transitions, 14370 flow
[2024-02-28 17:16:31,995 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 91.18181818181819) internal successors, (1003), 11 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:31,995 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:16:31,995 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:16:32,001 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-02-28 17:16:32,195 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-02-28 17:16:32,196 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:16:32,197 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:16:32,197 INFO  L85        PathProgramCache]: Analyzing trace with hash -1403000896, now seen corresponding path program 1 times
[2024-02-28 17:16:32,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:16:32,198 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47739544]
[2024-02-28 17:16:32,198 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:16:32,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:16:32,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:16:32,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:16:32,514 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:16:32,514 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47739544]
[2024-02-28 17:16:32,514 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47739544] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:16:32,514 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945170764]
[2024-02-28 17:16:32,515 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:16:32,515 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:16:32,515 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:16:32,516 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:16:32,521 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-02-28 17:16:32,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:16:32,617 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-02-28 17:16:32,619 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:16:32,629 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:16:32,632 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2024-02-28 17:16:32,714 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:16:32,714 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2024-02-28 17:16:32,738 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:16:32,739 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-02-28 17:16:32,766 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 17:16:32,784 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 17:16:32,798 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 17:16:32,814 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:16:32,815 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 17:16:32,828 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:16:32,829 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 17:16:32,840 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:16:32,846 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:16:32,846 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:16:32,846 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [945170764] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:16:32,846 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 17:16:32,847 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 12
[2024-02-28 17:16:32,847 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372205203]
[2024-02-28 17:16:32,847 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:16:32,847 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-02-28 17:16:32,847 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:16:32,848 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-02-28 17:16:32,848 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2024-02-28 17:16:33,514 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217
[2024-02-28 17:16:33,515 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 999 transitions, 14370 flow. Second operand  has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:33,515 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:16:33,515 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217
[2024-02-28 17:16:33,515 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:16:39,587 INFO  L130       PetriNetUnfolder]: 14478/26890 cut-off events.
[2024-02-28 17:16:39,587 INFO  L131       PetriNetUnfolder]: For 258288/259655 co-relation queries the response was YES.
[2024-02-28 17:16:39,705 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 169027 conditions, 26890 events. 14478/26890 cut-off events. For 258288/259655 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 223662 event pairs, 1217 based on Foata normal form. 518/26956 useless extension candidates. Maximal degree in co-relation 168975. Up to 10035 conditions per place. 
[2024-02-28 17:16:39,807 INFO  L137   encePairwiseOnDemand]: 206/217 looper letters, 1230 selfloop transitions, 93 changer transitions 15/1486 dead transitions.
[2024-02-28 17:16:39,807 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1486 transitions, 23687 flow
[2024-02-28 17:16:39,807 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-02-28 17:16:39,808 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-02-28 17:16:39,809 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1057 transitions.
[2024-02-28 17:16:39,810 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5412186379928315
[2024-02-28 17:16:39,810 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1057 transitions.
[2024-02-28 17:16:39,810 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1057 transitions.
[2024-02-28 17:16:39,810 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:16:39,810 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1057 transitions.
[2024-02-28 17:16:39,811 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 117.44444444444444) internal successors, (1057), 9 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:39,813 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:39,813 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:39,814 INFO  L175             Difference]: Start difference. First operand has 163 places, 999 transitions, 14370 flow. Second operand 9 states and 1057 transitions.
[2024-02-28 17:16:39,814 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 1486 transitions, 23687 flow
[2024-02-28 17:16:41,583 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 1486 transitions, 23017 flow, removed 328 selfloop flow, removed 3 redundant places.
[2024-02-28 17:16:41,599 INFO  L231             Difference]: Finished difference. Result has 165 places, 998 transitions, 13986 flow
[2024-02-28 17:16:41,599 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=13800, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=905, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13986, PETRI_PLACES=165, PETRI_TRANSITIONS=998}
[2024-02-28 17:16:41,599 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 98 predicate places.
[2024-02-28 17:16:41,600 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 998 transitions, 13986 flow
[2024-02-28 17:16:41,600 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:16:41,600 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:16:41,600 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:16:41,605 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-02-28 17:16:41,801 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:16:41,802 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:16:41,802 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:16:41,802 INFO  L85        PathProgramCache]: Analyzing trace with hash 1127119439, now seen corresponding path program 3 times
[2024-02-28 17:16:41,802 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:16:41,802 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786425639]
[2024-02-28 17:16:41,802 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:16:41,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:16:41,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:16:42,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:16:42,236 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:16:42,236 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786425639]
[2024-02-28 17:16:42,236 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786425639] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:16:42,236 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555022043]
[2024-02-28 17:16:42,236 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-02-28 17:16:42,236 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:16:42,236 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:16:42,237 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:16:42,239 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-02-28 17:16:42,379 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-02-28 17:16:42,379 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:16:42,381 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 58 conjunts are in the unsatisfiable core
[2024-02-28 17:16:42,384 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:16:42,396 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2024-02-28 17:16:42,559 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:16:42,560 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-02-28 17:16:42,564 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:16:42,565 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-02-28 17:16:42,658 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-02-28 17:16:42,671 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-02-28 17:16:42,807 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 17:16:42,874 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 17:16:42,949 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-02-28 17:16:42,957 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 17:16:42,998 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 17:16:43,040 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-02-28 17:16:43,068 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 17:16:43,125 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:16:43,148 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:16:43,170 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:16:43,251 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:16:43,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:16:43,292 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:16:43,328 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_964 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_964 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2024-02-28 17:17:00,226 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))))))) is different from false
[2024-02-28 17:17:00,250 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (+ c_~datas~0.offset 3 .cse2))) (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse0 c_~datas~0.base (store (select .cse0 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse3 c_~datas~0.base (store (select .cse3 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse4 c_~datas~0.base (store (select .cse4 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse5 c_~datas~0.base (store (select .cse5 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 17:17:00,877 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:17:00,877 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 80
[2024-02-28 17:17:00,887 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:17:00,887 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 277 treesize of output 179
[2024-02-28 17:17:00,895 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 135
[2024-02-28 17:17:00,904 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69
[2024-02-28 17:17:00,908 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 114
[2024-02-28 17:17:00,956 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:17:00,957 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 1
[2024-02-28 17:17:00,963 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:17:00,964 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 1
[2024-02-28 17:17:00,970 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:17:00,970 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 1
[2024-02-28 17:17:01,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:17:01,176 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555022043] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:17:01,176 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:17:01,176 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30
[2024-02-28 17:17:01,176 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077509501]
[2024-02-28 17:17:01,176 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:17:01,177 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-02-28 17:17:01,177 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:17:01,178 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-02-28 17:17:01,179 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=618, Unknown=71, NotChecked=168, Total=992
[2024-02-28 17:17:01,185 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 217
[2024-02-28 17:17:01,186 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 998 transitions, 13986 flow. Second operand  has 32 states, 32 states have (on average 68.3125) internal successors, (2186), 32 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:01,186 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:17:01,186 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 217
[2024-02-28 17:17:01,186 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:17:17,527 INFO  L130       PetriNetUnfolder]: 25390/41997 cut-off events.
[2024-02-28 17:17:17,527 INFO  L131       PetriNetUnfolder]: For 365076/365076 co-relation queries the response was YES.
[2024-02-28 17:17:17,740 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 261786 conditions, 41997 events. 25390/41997 cut-off events. For 365076/365076 co-relation queries the response was YES. Maximal size of possible extension queue 1168. Compared 316891 event pairs, 4210 based on Foata normal form. 201/42198 useless extension candidates. Maximal degree in co-relation 261736. Up to 17367 conditions per place. 
[2024-02-28 17:17:17,897 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 1213 selfloop transitions, 584 changer transitions 59/1859 dead transitions.
[2024-02-28 17:17:17,897 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1859 transitions, 27522 flow
[2024-02-28 17:17:17,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-02-28 17:17:17,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2024-02-28 17:17:17,900 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1827 transitions.
[2024-02-28 17:17:17,900 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.38269794721407624
[2024-02-28 17:17:17,901 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1827 transitions.
[2024-02-28 17:17:17,901 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1827 transitions.
[2024-02-28 17:17:17,901 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:17:17,901 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1827 transitions.
[2024-02-28 17:17:17,903 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 83.04545454545455) internal successors, (1827), 22 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:17,907 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 217.0) internal successors, (4991), 23 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:17,907 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 217.0) internal successors, (4991), 23 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:17,907 INFO  L175             Difference]: Start difference. First operand has 165 places, 998 transitions, 13986 flow. Second operand 22 states and 1827 transitions.
[2024-02-28 17:17:17,907 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1859 transitions, 27522 flow
[2024-02-28 17:17:20,060 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 1859 transitions, 27148 flow, removed 0 selfloop flow, removed 8 redundant places.
[2024-02-28 17:17:20,081 INFO  L231             Difference]: Finished difference. Result has 186 places, 1230 transitions, 19430 flow
[2024-02-28 17:17:20,082 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=13800, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=375, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=19430, PETRI_PLACES=186, PETRI_TRANSITIONS=1230}
[2024-02-28 17:17:20,082 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 119 predicate places.
[2024-02-28 17:17:20,082 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 1230 transitions, 19430 flow
[2024-02-28 17:17:20,082 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 68.3125) internal successors, (2186), 32 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:20,083 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:17:20,083 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:17:20,087 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-02-28 17:17:20,287 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:17:20,287 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:17:20,288 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:17:20,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -1195414565, now seen corresponding path program 4 times
[2024-02-28 17:17:20,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:17:20,289 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421509520]
[2024-02-28 17:17:20,289 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:17:20,289 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:17:20,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:17:20,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:17:20,793 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:17:20,793 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421509520]
[2024-02-28 17:17:20,793 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421509520] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:17:20,793 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879326976]
[2024-02-28 17:17:20,793 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-02-28 17:17:20,793 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:17:20,793 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:17:20,794 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:17:20,796 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-02-28 17:17:21,004 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-02-28 17:17:21,005 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:17:21,006 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 60 conjunts are in the unsatisfiable core
[2024-02-28 17:17:21,012 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:17:21,031 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:17:21,035 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2024-02-28 17:17:21,267 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:17:21,268 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-02-28 17:17:21,278 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:17:21,279 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-02-28 17:17:21,451 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:17:21,452 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-02-28 17:17:21,469 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:17:21,471 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-02-28 17:17:21,550 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 17:17:21,611 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 17:17:21,623 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-02-28 17:17:21,674 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 17:17:21,753 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 17:17:21,832 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 17:17:21,916 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:17:21,917 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:17:21,962 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:17:21,963 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:17:22,002 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:17:22,003 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:17:22,042 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:17:22,043 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:17:22,192 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:17:22,194 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:17:22,195 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60
[2024-02-28 17:17:22,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:17:22,266 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:17:22,294 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))))) is different from false
[2024-02-28 17:17:22,431 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))) is different from false
[2024-02-28 17:17:22,567 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))))) is different from false
[2024-02-28 17:17:22,608 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse3 (+ c_~datas~0.offset 2 .cse2)) (.cse1 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse1))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse3))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))))) is different from false
[2024-02-28 17:17:22,657 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset .cse4 1)) (.cse3 (+ c_~datas~0.offset 2 .cse4)) (.cse1 (+ c_~datas~0.offset 3 .cse4))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse1))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse2))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))))) is different from false
[2024-02-28 17:17:22,708 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse5 (+ c_~datas~0.offset .cse4 1)) (.cse3 (+ c_~datas~0.offset 2 .cse4)) (.cse2 (+ c_~datas~0.offset 3 .cse4))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) .cse2))))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|)))))))) is different from false
[2024-02-28 17:17:22,744 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:17:22,744 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 74
[2024-02-28 17:17:22,755 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:17:22,755 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 189 treesize of output 91
[2024-02-28 17:17:22,762 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 53
[2024-02-28 17:17:22,776 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:17:22,777 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46
[2024-02-28 17:17:22,841 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 17:17:22,841 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 1
[2024-02-28 17:17:22,851 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 17:17:22,851 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 1
[2024-02-28 17:17:22,863 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 17:17:22,863 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 1
[2024-02-28 17:17:23,027 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:17:23,028 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879326976] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:17:23,028 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:17:23,028 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30
[2024-02-28 17:17:23,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30760239]
[2024-02-28 17:17:23,028 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:17:23,029 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-02-28 17:17:23,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:17:23,029 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-02-28 17:17:23,030 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=544, Unknown=8, NotChecked=318, Total=992
[2024-02-28 17:17:23,313 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 217
[2024-02-28 17:17:23,315 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 1230 transitions, 19430 flow. Second operand  has 32 states, 32 states have (on average 68.3125) internal successors, (2186), 32 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:23,315 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:17:23,315 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 217
[2024-02-28 17:17:23,315 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:17:45,037 INFO  L130       PetriNetUnfolder]: 28151/46603 cut-off events.
[2024-02-28 17:17:45,037 INFO  L131       PetriNetUnfolder]: For 590156/590166 co-relation queries the response was YES.
[2024-02-28 17:17:45,345 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 331463 conditions, 46603 events. 28151/46603 cut-off events. For 590156/590166 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 356428 event pairs, 4382 based on Foata normal form. 206/46804 useless extension candidates. Maximal degree in co-relation 331405. Up to 17274 conditions per place. 
[2024-02-28 17:17:45,534 INFO  L137   encePairwiseOnDemand]: 180/217 looper letters, 1439 selfloop transitions, 726 changer transitions 95/2263 dead transitions.
[2024-02-28 17:17:45,534 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 2263 transitions, 37749 flow
[2024-02-28 17:17:45,534 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2024-02-28 17:17:45,535 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2024-02-28 17:17:45,536 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2342 transitions.
[2024-02-28 17:17:45,537 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.37215954234864135
[2024-02-28 17:17:45,537 INFO  L72            ComplementDD]: Start complementDD. Operand 29 states and 2342 transitions.
[2024-02-28 17:17:45,537 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 29 states and 2342 transitions.
[2024-02-28 17:17:45,537 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:17:45,537 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2342 transitions.
[2024-02-28 17:17:45,540 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 30 states, 29 states have (on average 80.75862068965517) internal successors, (2342), 29 states have internal predecessors, (2342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:45,544 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 30 states, 30 states have (on average 217.0) internal successors, (6510), 30 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:45,545 INFO  L81            ComplementDD]: Finished complementDD. Result  has 30 states, 30 states have (on average 217.0) internal successors, (6510), 30 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:45,545 INFO  L175             Difference]: Start difference. First operand has 186 places, 1230 transitions, 19430 flow. Second operand 29 states and 2342 transitions.
[2024-02-28 17:17:45,545 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 2263 transitions, 37749 flow
[2024-02-28 17:17:50,174 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 2263 transitions, 36923 flow, removed 338 selfloop flow, removed 9 redundant places.
[2024-02-28 17:17:50,202 INFO  L231             Difference]: Finished difference. Result has 219 places, 1626 transitions, 27977 flow
[2024-02-28 17:17:50,203 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=18681, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=392, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=27977, PETRI_PLACES=219, PETRI_TRANSITIONS=1626}
[2024-02-28 17:17:50,203 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 152 predicate places.
[2024-02-28 17:17:50,203 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 1626 transitions, 27977 flow
[2024-02-28 17:17:50,204 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 68.3125) internal successors, (2186), 32 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:50,204 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:17:50,204 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2024-02-28 17:17:50,311 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-02-28 17:17:50,405 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2024-02-28 17:17:50,405 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:17:50,406 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:17:50,406 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108278345, now seen corresponding path program 1 times
[2024-02-28 17:17:50,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:17:50,407 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384555655]
[2024-02-28 17:17:50,407 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:17:50,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:17:50,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:17:50,435 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 17:17:50,443 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:17:50,449 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 17:17:50,449 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 17:17:50,450 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2024-02-28 17:17:50,450 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2024-02-28 17:17:50,450 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2024-02-28 17:17:50,450 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2024-02-28 17:17:50,450 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2024-02-28 17:17:50,450 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2024-02-28 17:17:50,450 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2024-02-28 17:17:50,450 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining)
[2024-02-28 17:17:50,450 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2024-02-28 17:17:50,450 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2024-02-28 17:17:50,450 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2024-02-28 17:17:50,450 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2024-02-28 17:17:50,450 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2024-02-28 17:17:50,450 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-02-28 17:17:50,450 INFO  L445         BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:17:50,451 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 17:17:50,451 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-02-28 17:17:50,465 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-02-28 17:17:50,466 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 156 places, 155 transitions, 340 flow
[2024-02-28 17:17:50,494 INFO  L130       PetriNetUnfolder]: 21/500 cut-off events.
[2024-02-28 17:17:50,494 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2024-02-28 17:17:50,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 528 conditions, 500 events. 21/500 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1504 event pairs, 1 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 297. Up to 16 conditions per place. 
[2024-02-28 17:17:50,495 INFO  L82        GeneralOperation]: Start removeDead. Operand has 156 places, 155 transitions, 340 flow
[2024-02-28 17:17:50,497 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 156 places, 155 transitions, 340 flow
[2024-02-28 17:17:50,497 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 17:17:50,497 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 155 transitions, 340 flow
[2024-02-28 17:17:50,497 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 155 transitions, 340 flow
[2024-02-28 17:17:50,497 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 156 places, 155 transitions, 340 flow
[2024-02-28 17:17:50,525 INFO  L130       PetriNetUnfolder]: 21/500 cut-off events.
[2024-02-28 17:17:50,525 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2024-02-28 17:17:50,526 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 528 conditions, 500 events. 21/500 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1504 event pairs, 1 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 297. Up to 16 conditions per place. 
[2024-02-28 17:17:50,533 INFO  L119        LiptonReduction]: Number of co-enabled transitions 8964
[2024-02-28 17:17:53,231 INFO  L134        LiptonReduction]: Checked pairs total: 51687
[2024-02-28 17:17:53,232 INFO  L136        LiptonReduction]: Total number of compositions: 90
[2024-02-28 17:17:53,233 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 17:17:53,233 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59fcf406, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 17:17:53,233 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2024-02-28 17:17:53,234 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-02-28 17:17:53,234 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 17:17:53,234 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:17:53,234 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-02-28 17:17:53,234 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 17:17:53,234 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:17:53,234 INFO  L85        PathProgramCache]: Analyzing trace with hash 881, now seen corresponding path program 1 times
[2024-02-28 17:17:53,234 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:17:53,234 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932638220]
[2024-02-28 17:17:53,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:17:53,234 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:17:53,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:17:53,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:17:53,238 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:17:53,238 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932638220]
[2024-02-28 17:17:53,238 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932638220] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:17:53,238 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:17:53,238 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-02-28 17:17:53,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402956759]
[2024-02-28 17:17:53,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:17:53,238 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-02-28 17:17:53,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:17:53,239 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-02-28 17:17:53,239 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-02-28 17:17:53,239 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 245
[2024-02-28 17:17:53,239 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 182 flow. Second operand  has 2 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:53,239 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:17:53,239 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 245
[2024-02-28 17:17:53,239 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:17:53,826 INFO  L130       PetriNetUnfolder]: 3680/8504 cut-off events.
[2024-02-28 17:17:53,826 INFO  L131       PetriNetUnfolder]: For 651/1631 co-relation queries the response was YES.
[2024-02-28 17:17:53,835 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14271 conditions, 8504 events. 3680/8504 cut-off events. For 651/1631 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 72254 event pairs, 3637 based on Foata normal form. 0/7834 useless extension candidates. Maximal degree in co-relation 11836. Up to 5535 conditions per place. 
[2024-02-28 17:17:53,854 INFO  L137   encePairwiseOnDemand]: 244/245 looper letters, 28 selfloop transitions, 0 changer transitions 0/75 dead transitions.
[2024-02-28 17:17:53,854 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 236 flow
[2024-02-28 17:17:53,855 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-02-28 17:17:53,855 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-02-28 17:17:53,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 321 transitions.
[2024-02-28 17:17:53,855 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6551020408163265
[2024-02-28 17:17:53,855 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 321 transitions.
[2024-02-28 17:17:53,855 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 321 transitions.
[2024-02-28 17:17:53,855 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:17:53,855 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 321 transitions.
[2024-02-28 17:17:53,856 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:53,856 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:53,856 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:53,857 INFO  L175             Difference]: Start difference. First operand has 80 places, 76 transitions, 182 flow. Second operand 2 states and 321 transitions.
[2024-02-28 17:17:53,857 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 236 flow
[2024-02-28 17:17:53,858 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:17:53,858 INFO  L231             Difference]: Finished difference. Result has 80 places, 75 transitions, 180 flow
[2024-02-28 17:17:53,858 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=80, PETRI_TRANSITIONS=75}
[2024-02-28 17:17:53,859 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places.
[2024-02-28 17:17:53,859 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 180 flow
[2024-02-28 17:17:53,859 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:53,859 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:17:53,859 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:17:53,859 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-02-28 17:17:53,859 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 17:17:53,859 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:17:53,859 INFO  L85        PathProgramCache]: Analyzing trace with hash 847683071, now seen corresponding path program 1 times
[2024-02-28 17:17:53,859 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:17:53,860 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666146631]
[2024-02-28 17:17:53,860 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:17:53,860 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:17:53,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:17:53,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:17:53,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:17:53,963 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666146631]
[2024-02-28 17:17:53,963 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666146631] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:17:53,963 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:17:53,963 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:17:53,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565866928]
[2024-02-28 17:17:53,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:17:53,963 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:17:53,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:17:53,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:17:53,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:17:54,155 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245
[2024-02-28 17:17:54,156 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 180 flow. Second operand  has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:17:54,156 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:17:54,156 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245
[2024-02-28 17:17:54,156 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:01,101 INFO  L130       PetriNetUnfolder]: 75663/120904 cut-off events.
[2024-02-28 17:18:01,101 INFO  L131       PetriNetUnfolder]: For 3763/4244 co-relation queries the response was YES.
[2024-02-28 17:18:01,230 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 231350 conditions, 120904 events. 75663/120904 cut-off events. For 3763/4244 co-relation queries the response was YES. Maximal size of possible extension queue 2764. Compared 1003932 event pairs, 19231 based on Foata normal form. 157/116594 useless extension candidates. Maximal degree in co-relation 231344. Up to 73144 conditions per place. 
[2024-02-28 17:18:01,579 INFO  L137   encePairwiseOnDemand]: 214/245 looper letters, 111 selfloop transitions, 64 changer transitions 0/196 dead transitions.
[2024-02-28 17:18:01,579 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 196 transitions, 793 flow
[2024-02-28 17:18:01,580 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:18:01,580 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:18:01,580 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 856 transitions.
[2024-02-28 17:18:01,581 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.582312925170068
[2024-02-28 17:18:01,581 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 856 transitions.
[2024-02-28 17:18:01,581 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 856 transitions.
[2024-02-28 17:18:01,581 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:01,581 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 856 transitions.
[2024-02-28 17:18:01,582 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 142.66666666666666) internal successors, (856), 6 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,583 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,583 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,583 INFO  L175             Difference]: Start difference. First operand has 80 places, 75 transitions, 180 flow. Second operand 6 states and 856 transitions.
[2024-02-28 17:18:01,583 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 196 transitions, 793 flow
[2024-02-28 17:18:01,587 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 196 transitions, 793 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:01,588 INFO  L231             Difference]: Finished difference. Result has 90 places, 139 transitions, 626 flow
[2024-02-28 17:18:01,588 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=626, PETRI_PLACES=90, PETRI_TRANSITIONS=139}
[2024-02-28 17:18:01,589 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 10 predicate places.
[2024-02-28 17:18:01,589 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 139 transitions, 626 flow
[2024-02-28 17:18:01,589 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,589 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:01,589 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:01,589 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-02-28 17:18:01,589 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 17:18:01,589 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:01,590 INFO  L85        PathProgramCache]: Analyzing trace with hash -309025520, now seen corresponding path program 1 times
[2024-02-28 17:18:01,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:01,590 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819220476]
[2024-02-28 17:18:01,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:01,590 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:01,599 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:01,611 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:01,611 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:01,611 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819220476]
[2024-02-28 17:18:01,611 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819220476] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:01,612 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:01,612 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:18:01,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766144804]
[2024-02-28 17:18:01,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:01,613 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:18:01,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:01,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:18:01,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:18:01,629 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 245
[2024-02-28 17:18:01,629 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 139 transitions, 626 flow. Second operand  has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,629 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:01,629 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 245
[2024-02-28 17:18:01,629 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:04,486 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_181| v_~datas~0.base_125)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_27 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_111))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 3 v_~datas~0.offset_111)))))  InVars {#race=|v_#race_181|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_125, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_181|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_125, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [120#L1016-3true, 83#threadEXITtrue, 2#ULTIMATE.startEXITtrue, 162#true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), 126#L1016-1true, threadThread3of3ForFork0InUse])
[2024-02-28 17:18:04,486 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2024-02-28 17:18:04,486 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:18:04,486 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:18:04,487 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:18:04,487 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_181| v_~datas~0.base_125)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_27 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_111))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 3 v_~datas~0.offset_111)))))  InVars {#race=|v_#race_181|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_125, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_181|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_125, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [83#threadEXITtrue, 2#ULTIMATE.startEXITtrue, 162#true, 79#L1016-3true, 47#L1016-1true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2024-02-28 17:18:04,487 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2024-02-28 17:18:04,487 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:18:04,487 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:18:04,487 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:18:04,722 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_181| v_~datas~0.base_125)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_27 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_111))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 3 v_~datas~0.offset_111)))))  InVars {#race=|v_#race_181|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_125, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_181|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_125, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [120#L1016-3true, 83#threadEXITtrue, 2#ULTIMATE.startEXITtrue, 162#true, 79#L1016-3true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2024-02-28 17:18:04,722 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2024-02-28 17:18:04,722 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:18:04,722 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:18:04,722 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:18:04,723 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1016-4-->L1016-6: Formula: (= (store |v_#race_176| v_~datas~0.base_115 (store (select |v_#race_176| v_~datas~0.base_115) (+ (* v_threadThread2of3ForFork0_~i~0_21 4) v_~datas~0.offset_103) |v_threadThread2of3ForFork0_#t~nondet4_21|)) |v_#race_175|)  InVars {#race=|v_#race_176|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  OutVars{#race=|v_#race_175|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 95#L1016-6true, Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), 126#L1016-1true, threadThread3of3ForFork0InUse])
[2024-02-28 17:18:04,723 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2024-02-28 17:18:04,723 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:18:04,723 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:18:04,723 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:18:04,724 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([763] L1016-4-->L1016-6: Formula: (= |v_#race_161| (store |v_#race_162| v_~datas~0.base_105 (store (select |v_#race_162| v_~datas~0.base_105) (+ v_~datas~0.offset_93 (* v_threadThread3of3ForFork0_~i~0_19 4)) |v_threadThread3of3ForFork0_#t~nondet4_19|)))  InVars {#race=|v_#race_162|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  OutVars{#race=|v_#race_161|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_19|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, 47#L1016-1true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 51#L1016-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2024-02-28 17:18:04,724 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2024-02-28 17:18:04,724 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:18:04,724 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:18:04,724 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:18:04,935 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1016-4-->L1016-6: Formula: (= (store |v_#race_176| v_~datas~0.base_115 (store (select |v_#race_176| v_~datas~0.base_115) (+ (* v_threadThread2of3ForFork0_~i~0_21 4) v_~datas~0.offset_103) |v_threadThread2of3ForFork0_#t~nondet4_21|)) |v_#race_175|)  InVars {#race=|v_#race_176|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  OutVars{#race=|v_#race_175|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, 79#L1016-3true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 95#L1016-6true, Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2024-02-28 17:18:04,935 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2024-02-28 17:18:04,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:18:04,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:18:04,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:18:04,936 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([763] L1016-4-->L1016-6: Formula: (= |v_#race_161| (store |v_#race_162| v_~datas~0.base_105 (store (select |v_#race_162| v_~datas~0.base_105) (+ v_~datas~0.offset_93 (* v_threadThread3of3ForFork0_~i~0_19 4)) |v_threadThread3of3ForFork0_#t~nondet4_19|)))  InVars {#race=|v_#race_162|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  OutVars{#race=|v_#race_161|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_19|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [120#L1016-3true, 37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 51#L1016-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2024-02-28 17:18:04,936 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2024-02-28 17:18:05,038 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:18:05,038 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:18:05,038 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:18:06,567 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_183| v_~datas~0.base_131)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_27 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 2 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 3 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)))))  InVars {#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [83#threadEXITtrue, 162#true, 80#L1028-1true, 6#threadEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2024-02-28 17:18:06,567 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2024-02-28 17:18:06,567 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-02-28 17:18:06,567 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-02-28 17:18:06,567 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-02-28 17:18:06,567 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_183| v_~datas~0.base_131)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_27 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 2 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 3 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)))))  InVars {#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [83#threadEXITtrue, 162#true, 6#threadEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse, 92#L1030true])
[2024-02-28 17:18:06,567 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2024-02-28 17:18:06,567 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-02-28 17:18:06,567 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-02-28 17:18:06,567 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-02-28 17:18:06,730 INFO  L130       PetriNetUnfolder]: 36197/69251 cut-off events.
[2024-02-28 17:18:06,730 INFO  L131       PetriNetUnfolder]: For 38254/44798 co-relation queries the response was YES.
[2024-02-28 17:18:06,887 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 166379 conditions, 69251 events. 36197/69251 cut-off events. For 38254/44798 co-relation queries the response was YES. Maximal size of possible extension queue 2423. Compared 691296 event pairs, 15592 based on Foata normal form. 967/64854 useless extension candidates. Maximal degree in co-relation 166368. Up to 32701 conditions per place. 
[2024-02-28 17:18:07,184 INFO  L137   encePairwiseOnDemand]: 237/245 looper letters, 50 selfloop transitions, 4 changer transitions 0/147 dead transitions.
[2024-02-28 17:18:07,185 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 147 transitions, 764 flow
[2024-02-28 17:18:07,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:18:07,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:18:07,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions.
[2024-02-28 17:18:07,186 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6027210884353742
[2024-02-28 17:18:07,186 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 443 transitions.
[2024-02-28 17:18:07,186 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions.
[2024-02-28 17:18:07,186 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:07,186 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions.
[2024-02-28 17:18:07,187 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:07,187 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:07,187 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:07,187 INFO  L175             Difference]: Start difference. First operand has 90 places, 139 transitions, 626 flow. Second operand 3 states and 443 transitions.
[2024-02-28 17:18:07,188 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 147 transitions, 764 flow
[2024-02-28 17:18:07,646 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 147 transitions, 764 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:07,648 INFO  L231             Difference]: Finished difference. Result has 89 places, 139 transitions, 646 flow
[2024-02-28 17:18:07,648 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=89, PETRI_TRANSITIONS=139}
[2024-02-28 17:18:07,648 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places.
[2024-02-28 17:18:07,648 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 139 transitions, 646 flow
[2024-02-28 17:18:07,649 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:07,649 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:07,649 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:07,649 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-02-28 17:18:07,649 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 17:18:07,649 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:07,649 INFO  L85        PathProgramCache]: Analyzing trace with hash 871548223, now seen corresponding path program 1 times
[2024-02-28 17:18:07,649 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:07,649 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53321544]
[2024-02-28 17:18:07,649 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:07,650 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:07,658 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:07,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:07,804 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:07,804 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53321544]
[2024-02-28 17:18:07,804 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53321544] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:07,804 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:07,805 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:18:07,805 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122374039]
[2024-02-28 17:18:07,805 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:07,805 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:18:07,806 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:07,806 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:18:07,806 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:18:08,114 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 245
[2024-02-28 17:18:08,114 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 139 transitions, 646 flow. Second operand  has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:08,114 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:08,114 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 245
[2024-02-28 17:18:08,115 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:18,260 INFO  L130       PetriNetUnfolder]: 78201/123586 cut-off events.
[2024-02-28 17:18:18,261 INFO  L131       PetriNetUnfolder]: For 93941/95137 co-relation queries the response was YES.
[2024-02-28 17:18:18,574 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 340505 conditions, 123586 events. 78201/123586 cut-off events. For 93941/95137 co-relation queries the response was YES. Maximal size of possible extension queue 2848. Compared 1012760 event pairs, 27187 based on Foata normal form. 0/117879 useless extension candidates. Maximal degree in co-relation 340493. Up to 88234 conditions per place. 
[2024-02-28 17:18:19,023 INFO  L137   encePairwiseOnDemand]: 226/245 looper letters, 148 selfloop transitions, 102 changer transitions 0/291 dead transitions.
[2024-02-28 17:18:19,023 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 291 transitions, 1807 flow
[2024-02-28 17:18:19,024 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:18:19,024 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:18:19,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 875 transitions.
[2024-02-28 17:18:19,025 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5952380952380952
[2024-02-28 17:18:19,025 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 875 transitions.
[2024-02-28 17:18:19,025 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 875 transitions.
[2024-02-28 17:18:19,025 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:19,025 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 875 transitions.
[2024-02-28 17:18:19,026 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:19,027 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:19,027 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:19,028 INFO  L175             Difference]: Start difference. First operand has 89 places, 139 transitions, 646 flow. Second operand 6 states and 875 transitions.
[2024-02-28 17:18:19,028 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 291 transitions, 1807 flow
[2024-02-28 17:18:19,136 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 291 transitions, 1807 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:19,139 INFO  L231             Difference]: Finished difference. Result has 99 places, 240 transitions, 1604 flow
[2024-02-28 17:18:19,139 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1604, PETRI_PLACES=99, PETRI_TRANSITIONS=240}
[2024-02-28 17:18:19,140 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places.
[2024-02-28 17:18:19,140 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 240 transitions, 1604 flow
[2024-02-28 17:18:19,140 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:19,140 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:19,140 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:19,141 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-02-28 17:18:19,141 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 17:18:19,141 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:19,141 INFO  L85        PathProgramCache]: Analyzing trace with hash 1259099398, now seen corresponding path program 1 times
[2024-02-28 17:18:19,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:19,141 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386754407]
[2024-02-28 17:18:19,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:19,142 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:19,155 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:19,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:19,436 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:19,436 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386754407]
[2024-02-28 17:18:19,436 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386754407] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:19,436 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:19,436 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:18:19,436 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855763105]
[2024-02-28 17:18:19,437 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:19,437 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:18:19,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:19,437 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:18:19,438 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:18:19,644 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245
[2024-02-28 17:18:19,644 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 240 transitions, 1604 flow. Second operand  has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:19,644 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:19,645 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245
[2024-02-28 17:18:19,645 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:41,544 INFO  L130       PetriNetUnfolder]: 165587/252270 cut-off events.
[2024-02-28 17:18:41,544 INFO  L131       PetriNetUnfolder]: For 287960/290697 co-relation queries the response was YES.
[2024-02-28 17:18:42,259 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 817394 conditions, 252270 events. 165587/252270 cut-off events. For 287960/290697 co-relation queries the response was YES. Maximal size of possible extension queue 5144. Compared 2087933 event pairs, 47460 based on Foata normal form. 0/237885 useless extension candidates. Maximal degree in co-relation 817377. Up to 165386 conditions per place. 
[2024-02-28 17:18:43,319 INFO  L137   encePairwiseOnDemand]: 215/245 looper letters, 334 selfloop transitions, 162 changer transitions 0/517 dead transitions.
[2024-02-28 17:18:43,319 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 517 transitions, 4078 flow
[2024-02-28 17:18:43,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:18:43,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:18:43,320 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 906 transitions.
[2024-02-28 17:18:43,321 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6163265306122448
[2024-02-28 17:18:43,321 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 906 transitions.
[2024-02-28 17:18:43,321 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 906 transitions.
[2024-02-28 17:18:43,321 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:43,321 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 906 transitions.
[2024-02-28 17:18:43,322 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 151.0) internal successors, (906), 6 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:43,323 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:43,323 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:43,323 INFO  L175             Difference]: Start difference. First operand has 99 places, 240 transitions, 1604 flow. Second operand 6 states and 906 transitions.
[2024-02-28 17:18:43,323 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 517 transitions, 4078 flow
[2024-02-28 17:18:44,537 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 517 transitions, 4078 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:44,542 INFO  L231             Difference]: Finished difference. Result has 108 places, 395 transitions, 3161 flow
[2024-02-28 17:18:44,542 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3161, PETRI_PLACES=108, PETRI_TRANSITIONS=395}
[2024-02-28 17:18:44,542 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 28 predicate places.
[2024-02-28 17:18:44,542 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 395 transitions, 3161 flow
[2024-02-28 17:18:44,542 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:44,542 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:44,542 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:44,543 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-02-28 17:18:44,543 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 17:18:44,543 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:44,543 INFO  L85        PathProgramCache]: Analyzing trace with hash -610559931, now seen corresponding path program 1 times
[2024-02-28 17:18:44,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:44,543 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941656628]
[2024-02-28 17:18:44,543 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:44,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:44,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:44,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-02-28 17:18:44,736 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:44,736 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941656628]
[2024-02-28 17:18:44,736 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941656628] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:18:44,736 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610322548]
[2024-02-28 17:18:44,736 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:44,736 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:18:44,736 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:18:44,738 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:18:44,739 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-02-28 17:18:44,871 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:44,872 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2024-02-28 17:18:44,882 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:18:44,950 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:18:44,978 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:18:44,979 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 17:18:45,032 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:18:45,034 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:18:45,036 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 17:18:45,079 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:18:45,080 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:18:45,082 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:18:45,082 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 17:18:45,136 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:18:45,139 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 17:18:45,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-02-28 17:18:45,170 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:18:45,300 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))))) is different from false
[2024-02-28 17:18:45,318 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2)))))) is different from false
[2024-02-28 17:18:45,333 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))) is different from false
[2024-02-28 17:18:45,350 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:18:45,350 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2024-02-28 17:18:45,356 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:18:45,356 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2024-02-28 17:18:45,360 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-02-28 17:18:45,364 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:18:45,365 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-02-28 17:18:45,372 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:18:45,372 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-02-28 17:18:45,378 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:18:45,378 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-02-28 17:18:45,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked.
[2024-02-28 17:18:45,395 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610322548] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:18:45,395 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:18:45,395 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2024-02-28 17:18:45,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588581272]
[2024-02-28 17:18:45,396 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:18:45,396 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2024-02-28 17:18:45,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:45,396 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2024-02-28 17:18:45,396 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=133, Unknown=14, NotChecked=84, Total=306
[2024-02-28 17:18:45,397 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 245
[2024-02-28 17:18:45,398 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 395 transitions, 3161 flow. Second operand  has 18 states, 18 states have (on average 92.33333333333333) internal successors, (1662), 18 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:45,398 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:45,398 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 245
[2024-02-28 17:18:45,398 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:19:29,613 INFO  L130       PetriNetUnfolder]: 291944/413543 cut-off events.
[2024-02-28 17:19:29,614 INFO  L131       PetriNetUnfolder]: For 908623/908623 co-relation queries the response was YES.
[2024-02-28 17:19:30,969 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1581123 conditions, 413543 events. 291944/413543 cut-off events. For 908623/908623 co-relation queries the response was YES. Maximal size of possible extension queue 6781. Compared 3087256 event pairs, 146441 based on Foata normal form. 6822/389908 useless extension candidates. Maximal degree in co-relation 1581101. Up to 397760 conditions per place. 
[2024-02-28 17:19:32,609 INFO  L137   encePairwiseOnDemand]: 228/245 looper letters, 440 selfloop transitions, 7 changer transitions 11/464 dead transitions.
[2024-02-28 17:19:32,609 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 464 transitions, 4550 flow
[2024-02-28 17:19:32,610 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 17:19:32,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 17:19:32,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 739 transitions.
[2024-02-28 17:19:32,611 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.43090379008746355
[2024-02-28 17:19:32,611 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 739 transitions.
[2024-02-28 17:19:32,611 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 739 transitions.
[2024-02-28 17:19:32,611 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:19:32,611 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 739 transitions.
[2024-02-28 17:19:32,612 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:32,613 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:32,613 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:32,613 INFO  L175             Difference]: Start difference. First operand has 108 places, 395 transitions, 3161 flow. Second operand 7 states and 739 transitions.
[2024-02-28 17:19:32,613 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 464 transitions, 4550 flow
[2024-02-28 17:20:08,918 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 464 transitions, 4454 flow, removed 48 selfloop flow, removed 0 redundant places.
[2024-02-28 17:20:08,923 INFO  L231             Difference]: Finished difference. Result has 115 places, 396 transitions, 3125 flow
[2024-02-28 17:20:08,923 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=3053, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3125, PETRI_PLACES=115, PETRI_TRANSITIONS=396}
[2024-02-28 17:20:08,924 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 35 predicate places.
[2024-02-28 17:20:08,924 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 396 transitions, 3125 flow
[2024-02-28 17:20:08,924 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 92.33333333333333) internal successors, (1662), 18 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:08,924 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:20:08,924 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:20:08,931 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-02-28 17:20:09,125 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2024-02-28 17:20:09,126 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 17:20:09,127 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:20:09,127 INFO  L85        PathProgramCache]: Analyzing trace with hash 1345210140, now seen corresponding path program 1 times
[2024-02-28 17:20:09,127 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:20:09,127 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880287919]
[2024-02-28 17:20:09,128 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:20:09,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:20:09,144 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:20:09,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:20:09,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:20:09,339 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880287919]
[2024-02-28 17:20:09,339 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880287919] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:20:09,339 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:20:09,339 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-02-28 17:20:09,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857681660]
[2024-02-28 17:20:09,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:20:09,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-02-28 17:20:09,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:20:09,339 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-02-28 17:20:09,339 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-02-28 17:20:09,933 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245
[2024-02-28 17:20:09,934 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 396 transitions, 3125 flow. Second operand  has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:09,934 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:20:09,934 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245
[2024-02-28 17:20:09,934 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:20:47,858 INFO  L130       PetriNetUnfolder]: 228393/343031 cut-off events.
[2024-02-28 17:20:47,858 INFO  L131       PetriNetUnfolder]: For 757384/758365 co-relation queries the response was YES.
[2024-02-28 17:20:49,337 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1360038 conditions, 343031 events. 228393/343031 cut-off events. For 757384/758365 co-relation queries the response was YES. Maximal size of possible extension queue 7498. Compared 2876215 event pairs, 59414 based on Foata normal form. 3134/339928 useless extension candidates. Maximal degree in co-relation 1360011. Up to 157988 conditions per place. 
