./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6568ba33 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f --- Real Ultimate output --- This is Ultimate 0.2.3-?-6568ba3-m [2023-11-24 01:14:05,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 01:14:05,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-24 01:14:05,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 01:14:05,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 01:14:05,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 01:14:05,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 01:14:05,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 01:14:05,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 01:14:05,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 01:14:05,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 01:14:05,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 01:14:05,351 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 01:14:05,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 01:14:05,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 01:14:05,353 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 01:14:05,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 01:14:05,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 01:14:05,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 01:14:05,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 01:14:05,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 01:14:05,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 01:14:05,355 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-24 01:14:05,356 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 01:14:05,356 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 01:14:05,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 01:14:05,357 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 01:14:05,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 01:14:05,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 01:14:05,358 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-24 01:14:05,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 01:14:05,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 01:14:05,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 01:14:05,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 01:14:05,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 01:14:05,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 01:14:05,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 01:14:05,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 01:14:05,360 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-24 01:14:05,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 01:14:05,361 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 01:14:05,361 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 01:14:05,361 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 01:14:05,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-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 -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> GemCutter 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 -> 4ef1ebb9985ad6dadbe7cf99c72a7d7cbd507bc2d179a6afec5353fae325d63f [2023-11-24 01:14:05,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 01:14:05,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 01:14:05,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 01:14:05,702 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 01:14:05,702 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 01:14:05,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2023-11-24 01:14:06,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 01:14:07,162 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 01:14:07,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2023-11-24 01:14:07,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3cb9b4703/a933acec3af8416683f52a0b599fcda3/FLAGdfaf49c4d [2023-11-24 01:14:07,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3cb9b4703/a933acec3af8416683f52a0b599fcda3 [2023-11-24 01:14:07,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 01:14:07,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 01:14:07,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 01:14:07,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 01:14:07,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 01:14:07,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:14:07" (1/1) ... [2023-11-24 01:14:07,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ba9750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:07, skipping insertion in model container [2023-11-24 01:14:07,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:14:07" (1/1) ... [2023-11-24 01:14:07,275 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 01:14:07,908 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 01:14:07,931 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 01:14:08,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 01:14:08,114 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 01:14:08,114 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 01:14:08,120 INFO L206 MainTranslator]: Completed translation [2023-11-24 01:14:08,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:08 WrapperNode [2023-11-24 01:14:08,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 01:14:08,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 01:14:08,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 01:14:08,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 01:14:08,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:08" (1/1) ... [2023-11-24 01:14:08,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:08" (1/1) ... [2023-11-24 01:14:08,349 INFO L138 Inliner]: procedures = 490, calls = 133, calls flagged for inlining = 48, calls inlined = 122, statements flattened = 3341 [2023-11-24 01:14:08,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 01:14:08,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 01:14:08,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 01:14:08,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 01:14:08,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:08" (1/1) ... [2023-11-24 01:14:08,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:08" (1/1) ... [2023-11-24 01:14:08,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:08" (1/1) ... [2023-11-24 01:14:08,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:08" (1/1) ... [2023-11-24 01:14:08,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:08" (1/1) ... [2023-11-24 01:14:08,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:08" (1/1) ... [2023-11-24 01:14:08,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:08" (1/1) ... [2023-11-24 01:14:08,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:08" (1/1) ... [2023-11-24 01:14:08,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 01:14:08,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 01:14:08,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 01:14:08,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 01:14:08,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:08" (1/1) ... [2023-11-24 01:14:08,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 01:14:08,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:08,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 01:14:08,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 01:14:08,712 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2023-11-24 01:14:08,713 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2023-11-24 01:14:08,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 01:14:08,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 01:14:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 01:14:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 01:14:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-24 01:14:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 01:14:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-24 01:14:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 01:14:08,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 01:14:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 01:14:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 01:14:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-24 01:14:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 01:14:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 01:14:08,719 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 01:14:09,055 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 01:14:09,060 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 01:14:12,182 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 01:14:13,541 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 01:14:13,541 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-24 01:14:13,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:14:13 BoogieIcfgContainer [2023-11-24 01:14:13,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 01:14:13,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 01:14:13,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 01:14:13,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 01:14:13,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:14:07" (1/3) ... [2023-11-24 01:14:13,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f95572e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:14:13, skipping insertion in model container [2023-11-24 01:14:13,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:08" (2/3) ... [2023-11-24 01:14:13,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f95572e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:14:13, skipping insertion in model container [2023-11-24 01:14:13,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:14:13" (3/3) ... [2023-11-24 01:14:13,554 INFO L112 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2023-11-24 01:14:13,563 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 01:14:13,571 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 01:14:13,571 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 256 error locations. [2023-11-24 01:14:13,572 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 01:14:13,847 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-24 01:14:13,917 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 01:14:13,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 01:14:13,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:13,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 01:14:13,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-24 01:14:13,956 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 01:14:13,966 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 01:14:13,972 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@29ce1fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 01:14:13,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 235 error locations. [2023-11-24 01:14:14,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-24 01:14:14,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:14,011 INFO L85 PathProgramCache]: Analyzing trace with hash -175989322, now seen corresponding path program 1 times [2023-11-24 01:14:14,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:14,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047923264] [2023-11-24 01:14:14,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:14,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 01:14:14,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:14,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047923264] [2023-11-24 01:14:14,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047923264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:14,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:14,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:14:14,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836885637] [2023-11-24 01:14:14,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:14,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:14:14,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:14,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:14:14,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:14:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:14,825 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:14,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2023-11-24 01:14:14,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:14,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:14,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 01:14:14,886 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-24 01:14:14,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:14,887 INFO L85 PathProgramCache]: Analyzing trace with hash 550251739, now seen corresponding path program 1 times [2023-11-24 01:14:14,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:14,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679865752] [2023-11-24 01:14:14,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:14,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 01:14:15,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:15,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679865752] [2023-11-24 01:14:15,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679865752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:15,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:15,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:14:15,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100291120] [2023-11-24 01:14:15,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:15,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:14:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:15,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:14:15,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:14:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:15,402 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:15,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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) [2023-11-24 01:14:15,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:15,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:15,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:15,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:15,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 01:14:15,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-24 01:14:15,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2052957850, now seen corresponding path program 1 times [2023-11-24 01:14:15,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:15,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265365876] [2023-11-24 01:14:15,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:15,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 01:14:16,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:16,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265365876] [2023-11-24 01:14:16,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265365876] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:16,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:16,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:14:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369318401] [2023-11-24 01:14:16,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:16,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:14:16,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:16,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:14:16,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:14:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:16,091 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:16,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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) [2023-11-24 01:14:16,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:16,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:16,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:16,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:16,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 01:14:16,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-24 01:14:16,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:16,305 INFO L85 PathProgramCache]: Analyzing trace with hash -926548352, now seen corresponding path program 1 times [2023-11-24 01:14:16,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:16,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069906111] [2023-11-24 01:14:16,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:16,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 01:14:16,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:16,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069906111] [2023-11-24 01:14:16,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069906111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:16,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:16,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:14:16,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986291470] [2023-11-24 01:14:16,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:16,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:14:16,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:16,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:14:16,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:14:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:16,903 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:16,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 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) [2023-11-24 01:14:16,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:16,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:16,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:16,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:18,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 01:14:18,192 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-24 01:14:18,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:18,192 INFO L85 PathProgramCache]: Analyzing trace with hash -531652095, now seen corresponding path program 1 times [2023-11-24 01:14:18,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:18,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033474147] [2023-11-24 01:14:18,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:18,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 01:14:18,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:18,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033474147] [2023-11-24 01:14:18,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033474147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:18,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:18,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 01:14:18,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215292207] [2023-11-24 01:14:18,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:18,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 01:14:18,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:18,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 01:14:18,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 01:14:18,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:18,302 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:18,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) [2023-11-24 01:14:18,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:18,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 01:14:18,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-24 01:14:18,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:18,390 INFO L85 PathProgramCache]: Analyzing trace with hash -686131786, now seen corresponding path program 1 times [2023-11-24 01:14:18,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:18,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777639926] [2023-11-24 01:14:18,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:18,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 01:14:18,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777639926] [2023-11-24 01:14:18,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777639926] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:14:18,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880977329] [2023-11-24 01:14:18,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:18,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:14:18,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:18,653 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 01:14:18,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 01:14:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:18,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 01:14:18,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:14:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 01:14:18,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 01:14:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 01:14:18,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880977329] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 01:14:18,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 01:14:18,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-24 01:14:18,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758482765] [2023-11-24 01:14:18,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 01:14:18,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 01:14:18,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:18,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 01:14:18,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-24 01:14:18,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:18,982 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:18,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 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) [2023-11-24 01:14:18,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:18,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:18,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:19,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 01:14:19,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-24 01:14:19,319 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-24 01:14:19,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:19,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1739229462, now seen corresponding path program 2 times [2023-11-24 01:14:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:19,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058015925] [2023-11-24 01:14:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 01:14:19,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:19,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058015925] [2023-11-24 01:14:19,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058015925] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:14:19,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895278706] [2023-11-24 01:14:19,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 01:14:19,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:14:19,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:19,676 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 01:14:19,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 01:14:21,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 01:14:21,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 01:14:21,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-24 01:14:21,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:14:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 01:14:21,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 01:14:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 01:14:21,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895278706] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 01:14:21,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 01:14:21,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-11-24 01:14:21,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997506942] [2023-11-24 01:14:21,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 01:14:21,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 01:14:21,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:21,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 01:14:21,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-24 01:14:21,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:21,334 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:21,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 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) [2023-11-24 01:14:21,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:21,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:21,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:21,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:21,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:21,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:21,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:14:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:14:21,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 01:14:21,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:14:21,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 232 more)] === [2023-11-24 01:14:21,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:21,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1912732481, now seen corresponding path program 3 times [2023-11-24 01:14:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:21,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825186040] [2023-11-24 01:14:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:21,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 01:14:21,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 01:14:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 01:14:21,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 01:14:21,882 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 01:14:21,884 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (234 of 235 remaining) [2023-11-24 01:14:21,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (233 of 235 remaining) [2023-11-24 01:14:21,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (232 of 235 remaining) [2023-11-24 01:14:21,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (231 of 235 remaining) [2023-11-24 01:14:21,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (230 of 235 remaining) [2023-11-24 01:14:21,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (229 of 235 remaining) [2023-11-24 01:14:21,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (228 of 235 remaining) [2023-11-24 01:14:21,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (227 of 235 remaining) [2023-11-24 01:14:21,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (226 of 235 remaining) [2023-11-24 01:14:21,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr232ASSERT_VIOLATIONDATA_RACE (225 of 235 remaining) [2023-11-24 01:14:21,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (224 of 235 remaining) [2023-11-24 01:14:21,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (223 of 235 remaining) [2023-11-24 01:14:21,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (222 of 235 remaining) [2023-11-24 01:14:21,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (221 of 235 remaining) [2023-11-24 01:14:21,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (220 of 235 remaining) [2023-11-24 01:14:21,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr233ASSERT_VIOLATIONDATA_RACE (219 of 235 remaining) [2023-11-24 01:14:21,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181ASSERT_VIOLATIONDATA_RACE (218 of 235 remaining) [2023-11-24 01:14:21,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182ASSERT_VIOLATIONDATA_RACE (217 of 235 remaining) [2023-11-24 01:14:21,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184ASSERT_VIOLATIONDATA_RACE (216 of 235 remaining) [2023-11-24 01:14:21,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185ASSERT_VIOLATIONDATA_RACE (215 of 235 remaining) [2023-11-24 01:14:21,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183ASSERT_VIOLATIONDATA_RACE (214 of 235 remaining) [2023-11-24 01:14:21,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (213 of 235 remaining) [2023-11-24 01:14:21,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186ASSERT_VIOLATIONDATA_RACE (212 of 235 remaining) [2023-11-24 01:14:21,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (211 of 235 remaining) [2023-11-24 01:14:21,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (210 of 235 remaining) [2023-11-24 01:14:21,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (209 of 235 remaining) [2023-11-24 01:14:21,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (208 of 235 remaining) [2023-11-24 01:14:21,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (207 of 235 remaining) [2023-11-24 01:14:21,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187ASSERT_VIOLATIONDATA_RACE (206 of 235 remaining) [2023-11-24 01:14:21,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188ASSERT_VIOLATIONDATA_RACE (205 of 235 remaining) [2023-11-24 01:14:21,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (204 of 235 remaining) [2023-11-24 01:14:21,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189ASSERT_VIOLATIONDATA_RACE (203 of 235 remaining) [2023-11-24 01:14:21,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190ASSERT_VIOLATIONDATA_RACE (202 of 235 remaining) [2023-11-24 01:14:21,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192ASSERT_VIOLATIONDATA_RACE (201 of 235 remaining) [2023-11-24 01:14:21,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193ASSERT_VIOLATIONDATA_RACE (200 of 235 remaining) [2023-11-24 01:14:21,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191ASSERT_VIOLATIONDATA_RACE (199 of 235 remaining) [2023-11-24 01:14:21,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (198 of 235 remaining) [2023-11-24 01:14:21,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (197 of 235 remaining) [2023-11-24 01:14:21,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr194ASSERT_VIOLATIONDATA_RACE (196 of 235 remaining) [2023-11-24 01:14:21,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (195 of 235 remaining) [2023-11-24 01:14:21,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (194 of 235 remaining) [2023-11-24 01:14:21,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr195ASSERT_VIOLATIONDATA_RACE (193 of 235 remaining) [2023-11-24 01:14:21,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (192 of 235 remaining) [2023-11-24 01:14:21,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (191 of 235 remaining) [2023-11-24 01:14:21,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (190 of 235 remaining) [2023-11-24 01:14:21,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (189 of 235 remaining) [2023-11-24 01:14:21,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (188 of 235 remaining) [2023-11-24 01:14:21,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr198ASSERT_VIOLATIONDATA_RACE (187 of 235 remaining) [2023-11-24 01:14:21,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr199ASSERT_VIOLATIONDATA_RACE (186 of 235 remaining) [2023-11-24 01:14:21,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (185 of 235 remaining) [2023-11-24 01:14:21,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (184 of 235 remaining) [2023-11-24 01:14:21,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr196ASSERT_VIOLATIONDATA_RACE (183 of 235 remaining) [2023-11-24 01:14:21,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (182 of 235 remaining) [2023-11-24 01:14:21,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr197ASSERT_VIOLATIONDATA_RACE (181 of 235 remaining) [2023-11-24 01:14:21,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr229ASSERT_VIOLATIONDATA_RACE (180 of 235 remaining) [2023-11-24 01:14:21,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr200ASSERT_VIOLATIONDATA_RACE (179 of 235 remaining) [2023-11-24 01:14:21,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr201ASSERT_VIOLATIONDATA_RACE (178 of 235 remaining) [2023-11-24 01:14:21,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr203ASSERT_VIOLATIONDATA_RACE (177 of 235 remaining) [2023-11-24 01:14:21,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr204ASSERT_VIOLATIONDATA_RACE (176 of 235 remaining) [2023-11-24 01:14:21,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr202ASSERT_VIOLATIONDATA_RACE (175 of 235 remaining) [2023-11-24 01:14:21,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (174 of 235 remaining) [2023-11-24 01:14:21,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (173 of 235 remaining) [2023-11-24 01:14:21,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (172 of 235 remaining) [2023-11-24 01:14:21,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (171 of 235 remaining) [2023-11-24 01:14:21,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (170 of 235 remaining) [2023-11-24 01:14:21,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONDATA_RACE (169 of 235 remaining) [2023-11-24 01:14:21,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONDATA_RACE (168 of 235 remaining) [2023-11-24 01:14:21,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONDATA_RACE (167 of 235 remaining) [2023-11-24 01:14:21,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONDATA_RACE (166 of 235 remaining) [2023-11-24 01:14:21,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONDATA_RACE (165 of 235 remaining) [2023-11-24 01:14:21,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr230ASSERT_VIOLATIONDATA_RACE (164 of 235 remaining) [2023-11-24 01:14:21,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr205ASSERT_VIOLATIONDATA_RACE (163 of 235 remaining) [2023-11-24 01:14:21,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (162 of 235 remaining) [2023-11-24 01:14:21,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr231ASSERT_VIOLATIONDATA_RACE (161 of 235 remaining) [2023-11-24 01:14:21,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONDATA_RACE (160 of 235 remaining) [2023-11-24 01:14:21,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (159 of 235 remaining) [2023-11-24 01:14:21,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr206ASSERT_VIOLATIONDATA_RACE (158 of 235 remaining) [2023-11-24 01:14:21,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr207ASSERT_VIOLATIONDATA_RACE (157 of 235 remaining) [2023-11-24 01:14:21,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONDATA_RACE (156 of 235 remaining) [2023-11-24 01:14:21,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONDATA_RACE (155 of 235 remaining) [2023-11-24 01:14:21,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONDATA_RACE (154 of 235 remaining) [2023-11-24 01:14:21,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONDATA_RACE (153 of 235 remaining) [2023-11-24 01:14:21,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONDATA_RACE (152 of 235 remaining) [2023-11-24 01:14:21,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (151 of 235 remaining) [2023-11-24 01:14:21,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (150 of 235 remaining) [2023-11-24 01:14:21,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONDATA_RACE (149 of 235 remaining) [2023-11-24 01:14:21,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr208ASSERT_VIOLATIONDATA_RACE (148 of 235 remaining) [2023-11-24 01:14:21,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr209ASSERT_VIOLATIONDATA_RACE (147 of 235 remaining) [2023-11-24 01:14:21,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr211ASSERT_VIOLATIONDATA_RACE (146 of 235 remaining) [2023-11-24 01:14:21,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr212ASSERT_VIOLATIONDATA_RACE (145 of 235 remaining) [2023-11-24 01:14:21,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr210ASSERT_VIOLATIONDATA_RACE (144 of 235 remaining) [2023-11-24 01:14:21,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (143 of 235 remaining) [2023-11-24 01:14:21,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONDATA_RACE (142 of 235 remaining) [2023-11-24 01:14:21,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr213ASSERT_VIOLATIONDATA_RACE (141 of 235 remaining) [2023-11-24 01:14:21,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONDATA_RACE (140 of 235 remaining) [2023-11-24 01:14:21,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONDATA_RACE (139 of 235 remaining) [2023-11-24 01:14:21,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (138 of 235 remaining) [2023-11-24 01:14:21,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONDATA_RACE (137 of 235 remaining) [2023-11-24 01:14:21,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr214ASSERT_VIOLATIONDATA_RACE (136 of 235 remaining) [2023-11-24 01:14:21,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr217ASSERT_VIOLATIONDATA_RACE (135 of 235 remaining) [2023-11-24 01:14:21,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr218ASSERT_VIOLATIONDATA_RACE (134 of 235 remaining) [2023-11-24 01:14:21,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE (133 of 235 remaining) [2023-11-24 01:14:21,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONDATA_RACE (132 of 235 remaining) [2023-11-24 01:14:21,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONDATA_RACE (131 of 235 remaining) [2023-11-24 01:14:21,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr215ASSERT_VIOLATIONDATA_RACE (130 of 235 remaining) [2023-11-24 01:14:21,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONDATA_RACE (129 of 235 remaining) [2023-11-24 01:14:21,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONDATA_RACE (128 of 235 remaining) [2023-11-24 01:14:21,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONDATA_RACE (127 of 235 remaining) [2023-11-24 01:14:21,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONDATA_RACE (126 of 235 remaining) [2023-11-24 01:14:21,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONDATA_RACE (125 of 235 remaining) [2023-11-24 01:14:21,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONDATA_RACE (124 of 235 remaining) [2023-11-24 01:14:21,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONDATA_RACE (123 of 235 remaining) [2023-11-24 01:14:21,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr216ASSERT_VIOLATIONDATA_RACE (122 of 235 remaining) [2023-11-24 01:14:21,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONDATA_RACE (121 of 235 remaining) [2023-11-24 01:14:21,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONDATA_RACE (120 of 235 remaining) [2023-11-24 01:14:21,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONDATA_RACE (119 of 235 remaining) [2023-11-24 01:14:21,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONDATA_RACE (118 of 235 remaining) [2023-11-24 01:14:21,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONDATA_RACE (117 of 235 remaining) [2023-11-24 01:14:21,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONDATA_RACE (116 of 235 remaining) [2023-11-24 01:14:21,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONDATA_RACE (115 of 235 remaining) [2023-11-24 01:14:21,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONDATA_RACE (114 of 235 remaining) [2023-11-24 01:14:21,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONDATA_RACE (113 of 235 remaining) [2023-11-24 01:14:21,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr219ASSERT_VIOLATIONDATA_RACE (112 of 235 remaining) [2023-11-24 01:14:21,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr220ASSERT_VIOLATIONDATA_RACE (111 of 235 remaining) [2023-11-24 01:14:21,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr222ASSERT_VIOLATIONDATA_RACE (110 of 235 remaining) [2023-11-24 01:14:21,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr223ASSERT_VIOLATIONDATA_RACE (109 of 235 remaining) [2023-11-24 01:14:21,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr221ASSERT_VIOLATIONDATA_RACE (108 of 235 remaining) [2023-11-24 01:14:21,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONDATA_RACE (107 of 235 remaining) [2023-11-24 01:14:21,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONDATA_RACE (106 of 235 remaining) [2023-11-24 01:14:21,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr224ASSERT_VIOLATIONDATA_RACE (105 of 235 remaining) [2023-11-24 01:14:21,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONDATA_RACE (104 of 235 remaining) [2023-11-24 01:14:21,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONDATA_RACE (103 of 235 remaining) [2023-11-24 01:14:21,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONDATA_RACE (102 of 235 remaining) [2023-11-24 01:14:21,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONDATA_RACE (101 of 235 remaining) [2023-11-24 01:14:21,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONDATA_RACE (100 of 235 remaining) [2023-11-24 01:14:21,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONDATA_RACE (99 of 235 remaining) [2023-11-24 01:14:21,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONDATA_RACE (98 of 235 remaining) [2023-11-24 01:14:21,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONDATA_RACE (97 of 235 remaining) [2023-11-24 01:14:21,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONDATA_RACE (96 of 235 remaining) [2023-11-24 01:14:21,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONDATA_RACE (95 of 235 remaining) [2023-11-24 01:14:21,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONDATA_RACE (94 of 235 remaining) [2023-11-24 01:14:21,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONDATA_RACE (93 of 235 remaining) [2023-11-24 01:14:21,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONDATA_RACE (92 of 235 remaining) [2023-11-24 01:14:21,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONDATA_RACE (91 of 235 remaining) [2023-11-24 01:14:21,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONDATA_RACE (90 of 235 remaining) [2023-11-24 01:14:21,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONDATA_RACE (89 of 235 remaining) [2023-11-24 01:14:21,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONDATA_RACE (88 of 235 remaining) [2023-11-24 01:14:21,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONDATA_RACE (87 of 235 remaining) [2023-11-24 01:14:21,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONDATA_RACE (86 of 235 remaining) [2023-11-24 01:14:21,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr225ASSERT_VIOLATIONDATA_RACE (85 of 235 remaining) [2023-11-24 01:14:21,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr226ASSERT_VIOLATIONDATA_RACE (84 of 235 remaining) [2023-11-24 01:14:21,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONDATA_RACE (83 of 235 remaining) [2023-11-24 01:14:21,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONDATA_RACE (82 of 235 remaining) [2023-11-24 01:14:21,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONDATA_RACE (81 of 235 remaining) [2023-11-24 01:14:21,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONDATA_RACE (80 of 235 remaining) [2023-11-24 01:14:21,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONDATA_RACE (79 of 235 remaining) [2023-11-24 01:14:21,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONDATA_RACE (78 of 235 remaining) [2023-11-24 01:14:21,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONDATA_RACE (77 of 235 remaining) [2023-11-24 01:14:21,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr227ASSERT_VIOLATIONDATA_RACE (76 of 235 remaining) [2023-11-24 01:14:21,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr228ASSERT_VIOLATIONDATA_RACE (75 of 235 remaining) [2023-11-24 01:14:21,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONDATA_RACE (74 of 235 remaining) [2023-11-24 01:14:21,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONDATA_RACE (73 of 235 remaining) [2023-11-24 01:14:21,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONDATA_RACE (72 of 235 remaining) [2023-11-24 01:14:21,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONDATA_RACE (71 of 235 remaining) [2023-11-24 01:14:21,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138ASSERT_VIOLATIONDATA_RACE (70 of 235 remaining) [2023-11-24 01:14:21,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139ASSERT_VIOLATIONDATA_RACE (69 of 235 remaining) [2023-11-24 01:14:21,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141ASSERT_VIOLATIONDATA_RACE (68 of 235 remaining) [2023-11-24 01:14:21,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONDATA_RACE (67 of 235 remaining) [2023-11-24 01:14:21,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140ASSERT_VIOLATIONDATA_RACE (66 of 235 remaining) [2023-11-24 01:14:21,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONDATA_RACE (65 of 235 remaining) [2023-11-24 01:14:21,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONDATA_RACE (64 of 235 remaining) [2023-11-24 01:14:21,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONDATA_RACE (63 of 235 remaining) [2023-11-24 01:14:21,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONDATA_RACE (62 of 235 remaining) [2023-11-24 01:14:21,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONDATA_RACE (61 of 235 remaining) [2023-11-24 01:14:21,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONDATA_RACE (60 of 235 remaining) [2023-11-24 01:14:21,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONDATA_RACE (59 of 235 remaining) [2023-11-24 01:14:21,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147ASSERT_VIOLATIONDATA_RACE (58 of 235 remaining) [2023-11-24 01:14:21,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148ASSERT_VIOLATIONDATA_RACE (57 of 235 remaining) [2023-11-24 01:14:21,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONDATA_RACE (56 of 235 remaining) [2023-11-24 01:14:21,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONDATA_RACE (55 of 235 remaining) [2023-11-24 01:14:21,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONDATA_RACE (54 of 235 remaining) [2023-11-24 01:14:21,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONDATA_RACE (53 of 235 remaining) [2023-11-24 01:14:21,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONDATA_RACE (52 of 235 remaining) [2023-11-24 01:14:21,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONDATA_RACE (51 of 235 remaining) [2023-11-24 01:14:21,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONDATA_RACE (50 of 235 remaining) [2023-11-24 01:14:21,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONDATA_RACE (49 of 235 remaining) [2023-11-24 01:14:21,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONDATA_RACE (48 of 235 remaining) [2023-11-24 01:14:21,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146ASSERT_VIOLATIONDATA_RACE (47 of 235 remaining) [2023-11-24 01:14:21,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONDATA_RACE (46 of 235 remaining) [2023-11-24 01:14:21,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONDATA_RACE (45 of 235 remaining) [2023-11-24 01:14:21,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONDATA_RACE (44 of 235 remaining) [2023-11-24 01:14:21,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178ASSERT_VIOLATIONDATA_RACE (43 of 235 remaining) [2023-11-24 01:14:21,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONDATA_RACE (42 of 235 remaining) [2023-11-24 01:14:21,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149ASSERT_VIOLATIONDATA_RACE (41 of 235 remaining) [2023-11-24 01:14:21,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150ASSERT_VIOLATIONDATA_RACE (40 of 235 remaining) [2023-11-24 01:14:21,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152ASSERT_VIOLATIONDATA_RACE (39 of 235 remaining) [2023-11-24 01:14:21,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153ASSERT_VIOLATIONDATA_RACE (38 of 235 remaining) [2023-11-24 01:14:21,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151ASSERT_VIOLATIONDATA_RACE (37 of 235 remaining) [2023-11-24 01:14:21,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONDATA_RACE (36 of 235 remaining) [2023-11-24 01:14:21,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONDATA_RACE (35 of 235 remaining) [2023-11-24 01:14:21,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONDATA_RACE (34 of 235 remaining) [2023-11-24 01:14:21,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179ASSERT_VIOLATIONDATA_RACE (33 of 235 remaining) [2023-11-24 01:14:21,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONDATA_RACE (32 of 235 remaining) [2023-11-24 01:14:21,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONDATA_RACE (31 of 235 remaining) [2023-11-24 01:14:21,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154ASSERT_VIOLATIONDATA_RACE (30 of 235 remaining) [2023-11-24 01:14:21,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONDATA_RACE (29 of 235 remaining) [2023-11-24 01:14:21,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180ASSERT_VIOLATIONDATA_RACE (28 of 235 remaining) [2023-11-24 01:14:21,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONDATA_RACE (27 of 235 remaining) [2023-11-24 01:14:21,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONDATA_RACE (26 of 235 remaining) [2023-11-24 01:14:21,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONDATA_RACE (25 of 235 remaining) [2023-11-24 01:14:21,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONDATA_RACE (24 of 235 remaining) [2023-11-24 01:14:21,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONDATA_RACE (23 of 235 remaining) [2023-11-24 01:14:21,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155ASSERT_VIOLATIONDATA_RACE (22 of 235 remaining) [2023-11-24 01:14:21,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156ASSERT_VIOLATIONDATA_RACE (21 of 235 remaining) [2023-11-24 01:14:21,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157ASSERT_VIOLATIONDATA_RACE (20 of 235 remaining) [2023-11-24 01:14:21,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158ASSERT_VIOLATIONDATA_RACE (19 of 235 remaining) [2023-11-24 01:14:21,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160ASSERT_VIOLATIONDATA_RACE (18 of 235 remaining) [2023-11-24 01:14:21,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161ASSERT_VIOLATIONDATA_RACE (17 of 235 remaining) [2023-11-24 01:14:21,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159ASSERT_VIOLATIONDATA_RACE (16 of 235 remaining) [2023-11-24 01:14:21,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162ASSERT_VIOLATIONDATA_RACE (15 of 235 remaining) [2023-11-24 01:14:21,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163ASSERT_VIOLATIONDATA_RACE (14 of 235 remaining) [2023-11-24 01:14:21,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166ASSERT_VIOLATIONDATA_RACE (13 of 235 remaining) [2023-11-24 01:14:21,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167ASSERT_VIOLATIONDATA_RACE (12 of 235 remaining) [2023-11-24 01:14:21,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164ASSERT_VIOLATIONDATA_RACE (11 of 235 remaining) [2023-11-24 01:14:21,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165ASSERT_VIOLATIONDATA_RACE (10 of 235 remaining) [2023-11-24 01:14:21,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168ASSERT_VIOLATIONDATA_RACE (9 of 235 remaining) [2023-11-24 01:14:21,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169ASSERT_VIOLATIONDATA_RACE (8 of 235 remaining) [2023-11-24 01:14:21,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171ASSERT_VIOLATIONDATA_RACE (7 of 235 remaining) [2023-11-24 01:14:21,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172ASSERT_VIOLATIONDATA_RACE (6 of 235 remaining) [2023-11-24 01:14:21,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170ASSERT_VIOLATIONDATA_RACE (5 of 235 remaining) [2023-11-24 01:14:21,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173ASSERT_VIOLATIONDATA_RACE (4 of 235 remaining) [2023-11-24 01:14:21,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174ASSERT_VIOLATIONDATA_RACE (3 of 235 remaining) [2023-11-24 01:14:21,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175ASSERT_VIOLATIONDATA_RACE (2 of 235 remaining) [2023-11-24 01:14:21,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176ASSERT_VIOLATIONDATA_RACE (1 of 235 remaining) [2023-11-24 01:14:21,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177ASSERT_VIOLATIONDATA_RACE (0 of 235 remaining) [2023-11-24 01:14:21,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 01:14:21,946 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-24 01:14:21,949 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-11-24 01:14:21,950 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 01:14:21,950 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-24 01:14:22,165 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-24 01:14:22,186 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 01:14:22,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 01:14:22,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:22,188 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 01:14:22,194 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 01:14:22,195 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == StealerThread1of2ForFork0 ======== [2023-11-24 01:14:22,195 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@29ce1fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 01:14:22,195 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-24 01:14:22,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2023-11-24 01:14:27,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting StealerErr0ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:14:27,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:27,025 INFO L85 PathProgramCache]: Analyzing trace with hash 836256512, now seen corresponding path program 1 times [2023-11-24 01:14:27,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:27,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278620418] [2023-11-24 01:14:27,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:27,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 01:14:27,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:27,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278620418] [2023-11-24 01:14:27,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278620418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:27,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:27,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 01:14:27,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028031056] [2023-11-24 01:14:27,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:27,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 01:14:27,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:27,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 01:14:27,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 01:14:27,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:27,140 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:27,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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) [2023-11-24 01:14:27,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:28,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:28,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 01:14:28,621 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting StealerErr5ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:14:28,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:28,621 INFO L85 PathProgramCache]: Analyzing trace with hash -70047139, now seen corresponding path program 1 times [2023-11-24 01:14:28,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:28,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192114484] [2023-11-24 01:14:28,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:28,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 01:14:28,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:28,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192114484] [2023-11-24 01:14:28,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192114484] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:14:28,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356647420] [2023-11-24 01:14:28,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:28,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:14:28,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:28,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 01:14:28,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 01:14:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:29,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 01:14:29,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:14:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 01:14:29,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 01:14:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 01:14:29,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356647420] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 01:14:29,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 01:14:29,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-24 01:14:29,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618049120] [2023-11-24 01:14:29,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 01:14:29,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 01:14:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:29,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 01:14:29,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-24 01:14:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:29,278 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:29,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.4) internal successors, (184), 10 states have internal predecessors, (184), 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) [2023-11-24 01:14:29,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:29,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:29,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:29,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-24 01:14:29,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-24 01:14:29,875 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting StealerErr5ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:14:29,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2137809789, now seen corresponding path program 2 times [2023-11-24 01:14:29,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:29,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228661582] [2023-11-24 01:14:29,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:29,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 01:14:30,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:30,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228661582] [2023-11-24 01:14:30,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228661582] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:14:30,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232981448] [2023-11-24 01:14:30,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 01:14:30,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:14:30,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:30,218 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 01:14:30,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 01:14:30,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 01:14:30,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 01:14:30,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-24 01:14:30,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:14:30,600 INFO L378 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 [2023-11-24 01:14:30,615 INFO L378 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 19 treesize of output 18 [2023-11-24 01:14:30,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:14:30,641 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 01:14:30,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:14:30,668 INFO L378 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 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-24 01:14:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-24 01:14:30,692 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 01:14:30,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232981448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:30,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 01:14:30,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2023-11-24 01:14:30,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987928870] [2023-11-24 01:14:30,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:30,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 01:14:30,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:30,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 01:14:30,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-11-24 01:14:30,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:30,699 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:30,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 24.666666666666668) internal successors, (148), 7 states have internal predecessors, (148), 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) [2023-11-24 01:14:30,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:30,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:30,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:51,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:51,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:51,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:14:51,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-24 01:14:51,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:14:51,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting StealerErr14ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:14:51,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:51,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1951254827, now seen corresponding path program 1 times [2023-11-24 01:14:51,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:51,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371554834] [2023-11-24 01:14:51,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:51,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 01:14:52,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:52,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371554834] [2023-11-24 01:14:52,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371554834] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:14:52,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761590624] [2023-11-24 01:14:52,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:52,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:14:52,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:14:52,111 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 01:14:52,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-24 01:14:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:52,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-24 01:14:52,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:14:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 01:14:52,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 01:14:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 01:14:52,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761590624] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 01:14:52,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 01:14:52,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-11-24 01:14:52,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27058739] [2023-11-24 01:14:52,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 01:14:52,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 01:14:52,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:52,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 01:14:52,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-24 01:14:52,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:52,671 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:52,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.363636363636363) internal successors, (268), 11 states have internal predecessors, (268), 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) [2023-11-24 01:14:52,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:52,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:52,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:14:52,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:53,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:14:53,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:14:53,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-24 01:14:53,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-24 01:14:53,807 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting StealerErr14ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:14:53,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:14:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1579756590, now seen corresponding path program 2 times [2023-11-24 01:14:53,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:14:53,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729942861] [2023-11-24 01:14:53,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:14:53,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:14:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:14:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-24 01:14:54,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:14:54,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729942861] [2023-11-24 01:14:54,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729942861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:14:54,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:14:54,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:14:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623772175] [2023-11-24 01:14:54,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:14:54,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:14:54,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:14:54,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:14:54,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:14:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:14:54,983 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:14:54,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 43.4) internal successors, (217), 6 states have internal predecessors, (217), 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) [2023-11-24 01:14:54,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:14:54,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:14:54,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:14:54,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:14:54,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:05,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 01:15:05,019 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting StealerErr15ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:15:05,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:15:05,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1653352235, now seen corresponding path program 1 times [2023-11-24 01:15:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:15:05,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270246551] [2023-11-24 01:15:05,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:15:05,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:15:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:15:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-24 01:15:06,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:15:06,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270246551] [2023-11-24 01:15:06,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270246551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:15:06,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:15:06,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:15:06,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523501183] [2023-11-24 01:15:06,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:15:06,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:15:06,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:15:06,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:15:06,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:15:06,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:06,027 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:15:06,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 45.6) internal successors, (228), 6 states have internal predecessors, (228), 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) [2023-11-24 01:15:06,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:06,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:06,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:06,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:06,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:06,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:15,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:15,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:15,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:15,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:15,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:15,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:15,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 01:15:15,618 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting StealerErr16ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:15:15,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:15:15,618 INFO L85 PathProgramCache]: Analyzing trace with hash -343095830, now seen corresponding path program 1 times [2023-11-24 01:15:15,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:15:15,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831329113] [2023-11-24 01:15:15,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:15:15,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:15:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:15:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-24 01:15:16,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:15:16,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831329113] [2023-11-24 01:15:16,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831329113] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:15:16,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:15:16,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:15:16,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811577007] [2023-11-24 01:15:16,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:15:16,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:15:16,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:15:16,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:15:16,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:15:16,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:16,642 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:15:16,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 47.0) internal successors, (235), 6 states have internal predecessors, (235), 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) [2023-11-24 01:15:16,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:16,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:16,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:16,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:16,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:16,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:16,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:26,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 01:15:26,162 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting StealerErr19ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:15:26,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:15:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1780020610, now seen corresponding path program 1 times [2023-11-24 01:15:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:15:26,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346500125] [2023-11-24 01:15:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:15:26,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:15:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:15:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-24 01:15:27,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:15:27,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346500125] [2023-11-24 01:15:27,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346500125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:15:27,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:15:27,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:15:27,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476210998] [2023-11-24 01:15:27,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:15:27,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:15:27,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:15:27,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:15:27,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:15:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:27,195 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:15:27,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 50.6) internal successors, (253), 6 states have internal predecessors, (253), 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) [2023-11-24 01:15:27,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:27,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:27,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:27,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:27,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:27,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:27,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:27,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:37,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:37,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 01:15:37,198 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting StealerErr20ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:15:37,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:15:37,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1342777217, now seen corresponding path program 1 times [2023-11-24 01:15:37,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:15:37,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612664396] [2023-11-24 01:15:37,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:15:37,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:15:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:15:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-24 01:15:38,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:15:38,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612664396] [2023-11-24 01:15:38,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612664396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:15:38,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:15:38,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:15:38,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883014781] [2023-11-24 01:15:38,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:15:38,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:15:38,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:15:38,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:15:38,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:15:38,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:38,026 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:15:38,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 52.4) internal successors, (262), 6 states have internal predecessors, (262), 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) [2023-11-24 01:15:38,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:38,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:38,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:38,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:38,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:38,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:38,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:38,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:38,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:47,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:47,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:47,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:47,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:47,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:47,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:47,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 01:15:47,601 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting StealerErr21ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:15:47,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:15:47,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1389219974, now seen corresponding path program 1 times [2023-11-24 01:15:47,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:15:47,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295724084] [2023-11-24 01:15:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:15:47,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:15:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:15:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-24 01:15:48,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:15:48,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295724084] [2023-11-24 01:15:48,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295724084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:15:48,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:15:48,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:15:48,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197402729] [2023-11-24 01:15:48,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:15:48,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:15:48,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:15:48,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:15:48,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:15:48,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:15:48,450 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:15:48,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 54.0) internal successors, (270), 6 states have internal predecessors, (270), 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) [2023-11-24 01:15:48,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:15:48,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:15:48,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:15:48,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:15:48,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:48,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:48,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:48,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:48,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:15:48,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:16:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:16:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:16:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:16:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:16:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:16:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:16:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:16:00,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:16:00,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:16:00,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:16:00,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 01:16:00,725 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting StealerErr21ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:16:00,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:16:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash -247865934, now seen corresponding path program 1 times [2023-11-24 01:16:00,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:16:00,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638666256] [2023-11-24 01:16:00,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:16:00,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:16:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:16:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 5 proven. 49 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-24 01:16:24,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:16:24,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638666256] [2023-11-24 01:16:24,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638666256] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:16:24,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545663039] [2023-11-24 01:16:24,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:16:24,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:16:24,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:16:24,289 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 01:16:24,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-24 01:16:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:16:24,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 138 conjunts are in the unsatisfiable core [2023-11-24 01:16:24,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:16:24,976 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 01:16:24,976 INFO L378 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 11 treesize of output 11 [2023-11-24 01:16:25,622 INFO L378 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 15 treesize of output 1 [2023-11-24 01:16:26,788 INFO L378 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 19 treesize of output 18 [2023-11-24 01:16:27,201 INFO L378 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 23 treesize of output 16 [2023-11-24 01:16:27,337 INFO L378 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 23 treesize of output 16 [2023-11-24 01:16:27,492 INFO L378 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 23 treesize of output 16 [2023-11-24 01:16:27,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 01:16:27,789 INFO L378 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 23 treesize of output 16 [2023-11-24 01:16:27,992 INFO L378 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 23 treesize of output 16 [2023-11-24 01:16:28,663 INFO L378 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 21 [2023-11-24 01:16:29,203 INFO L378 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 21 [2023-11-24 01:16:30,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 01:16:30,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 01:16:30,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:30,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 24 [2023-11-24 01:16:31,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 01:16:31,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:31,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2023-11-24 01:16:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 5 proven. 49 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-24 01:16:31,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 01:16:32,244 INFO L349 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2023-11-24 01:16:32,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 205 treesize of output 242 [2023-11-24 01:16:32,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:32,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 193 treesize of output 214 [2023-11-24 01:16:32,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:32,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 208 [2023-11-24 01:16:32,375 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-24 01:16:32,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 149 [2023-11-24 01:16:32,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:16:32,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 143 treesize of output 137 [2023-11-24 01:16:32,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-11-24 01:16:32,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-11-24 01:16:32,455 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base|))) (let ((.cse2 (+ 104 |c_~#q~0.offset|)) (.cse0 (= (select .cse1 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (select (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base|) |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.offset|)))) (and (or (not .cse0) (and (forall ((v_DerPreprocessor_2 Int)) (<= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse1 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_2)) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0)) (forall ((v_DerPreprocessor_2 Int)) (<= 1 (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse1 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_DerPreprocessor_2)) |c_~#q~0.base|) .cse2))))) (or (and (forall ((v_DerPreprocessor_1 (Array Int Int))) (<= 1 (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_DerPreprocessor_1) |c_~#q~0.base|) .cse2))) (forall ((v_DerPreprocessor_1 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_DerPreprocessor_1) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0))) .cse0)))) is different from false [2023-11-24 01:16:32,957 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base|))) (let ((.cse0 (+ 104 |c_~#q~0.offset|)) (.cse1 (= (select .cse2 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset|) (select (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base|) |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.offset|)))) (and (or (and (forall ((v_DerPreprocessor_1 (Array Int Int))) (<= 1 (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base| v_DerPreprocessor_1) |c_~#q~0.base|) .cse0))) (forall ((v_DerPreprocessor_1 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base| v_DerPreprocessor_1) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0))) .cse1) (or (and (forall ((v_DerPreprocessor_2 Int)) (<= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base| (store .cse2 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset| v_DerPreprocessor_2)) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0)) (forall ((v_DerPreprocessor_2 Int)) (<= 1 (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base| (store .cse2 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset| v_DerPreprocessor_2)) |c_~#q~0.base|) .cse0)))) (not .cse1))))) is different from false [2023-11-24 01:16:32,993 INFO L378 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 5 treesize of output 3 [2023-11-24 01:17:10,759 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_4222 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))) (= (select .cse1 .cse3) 0))))) (forall ((v_ArrVal_4222 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse4 (select .cse5 |c_~#q~0.base|))) (or (< 0 (select .cse4 (+ 104 |c_~#q~0.offset|))) (forall ((v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse4 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))))))) (forall ((v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int)) (or (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (store (select .cse6 |c_~#q~0.base|) .cse2 v_ArrVal_4226))) (or (not (= (select (select (store .cse6 |c_~#q~0.base| .cse7) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (forall ((v_DerPreprocessor_2 Int)) (<= (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse3 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)))))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))))) is different from false [2023-11-24 01:17:11,469 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse0 (select .cse2 |c_~#q~0.base|))) (or (= (select .cse0 .cse1) 0) (forall ((v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse2 |c_~#q~0.base| (store .cse0 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))))))) (forall ((v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse5 (select .cse4 |c_~#q~0.base|))) (or (forall ((v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))) (< 0 (select .cse5 (+ 104 |c_~#q~0.offset|))))))) (forall ((v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int)) (or (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (store (select .cse6 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse6 |c_~#q~0.base| .cse7) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (forall ((v_DerPreprocessor_2 Int)) (<= (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse1 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)))))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))))) is different from false [2023-11-24 01:17:11,540 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int)) (or (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base|) (forall ((v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))) (= (select .cse1 .cse3) 0))))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int)) (or (forall ((v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int)) (or (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (forall ((|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse4 (store (store |c_#memory_int| |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse5 (store (select .cse4 |c_~#q~0.base|) .cse2 v_ArrVal_4226))) (or (forall ((v_DerPreprocessor_2 Int)) (<= (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (not (= (select (select (store .cse4 |c_~#q~0.base| .cse5) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)))))))) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base|))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int)) (or (forall ((v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse7 |c_~#q~0.base|))) (or (< 0 (select .cse6 (+ 104 |c_~#q~0.offset|))) (forall ((v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))))))) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base|))))) is different from false [2023-11-24 01:17:11,676 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 32 |c_~#q~0.offset|)) (.cse2 (+ |c_~#q~0.offset| 36))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store |c_#memory_int| |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse4 (store (store |c_#memory_int| |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse5 (select .cse4 |c_~#q~0.base|))) (or (not (= (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 (select .cse5 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse6 (store (store |c_#memory_int| |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (select .cse6 |c_~#q~0.base|))) (or (not (= (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (= (select .cse7 .cse2) 0) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-24 01:17:12,426 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (not (= 0 (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|) (< 0 (select .cse1 (+ 104 |c_~#q~0.offset|))))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse4 (select .cse3 |c_~#q~0.base|))) (or (not (= 0 (select (select (store .cse3 |c_~#q~0.base| (store .cse4 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))) (= 0 (select .cse4 .cse5)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (store (select .cse6 |c_~#q~0.base|) .cse2 v_ArrVal_4226))) (or (< (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse5 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (not (= 0 (select (select (store .cse6 |c_~#q~0.base| .cse7) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-24 01:17:12,487 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 (select .cse1 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse4 (store (select .cse3 |c_~#q~0.base|) .cse2 v_ArrVal_4226))) (or (not (= (select (select (store .cse3 |c_~#q~0.base| .cse4) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse3 |c_~#q~0.base| (store .cse4 .cse5 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse7 |c_~#q~0.base|))) (or (= (select .cse6 .cse5) 0) (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-24 01:17:12,603 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse0 (select .cse1 |c_~#q~0.base|))) (or (< 0 (select .cse0 (+ 104 |c_~#q~0.offset|))) (not (= (select (select (store .cse1 |c_~#q~0.base| (store .cse0 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse3 (select .cse5 |c_~#q~0.base|))) (or (= (select .cse3 .cse4) 0) (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse3 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (store (select .cse6 |c_~#q~0.base|) .cse2 v_ArrVal_4226))) (or (< (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse4 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (not (= (select (select (store .cse6 |c_~#q~0.base| .cse7) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-24 01:17:13,357 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4219 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4219) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4219 (Array Int Int))) (let ((.cse5 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4219) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse4 (select .cse5 |c_~#q~0.base|))) (or (= (select .cse4 .cse2) 0) (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse4 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4219 (Array Int Int))) (let ((.cse6 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4219) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (select .cse6 |c_~#q~0.base|))) (or (not (= (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|) (< 0 (select .cse7 (+ 104 |c_~#q~0.offset|))))))))) is different from false [2023-11-24 01:17:13,412 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4219 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4219) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse0 (select .cse1 |c_~#q~0.base|))) (or (< 0 (select .cse0 (+ 104 |c_~#q~0.offset|))) (not (= (select (select (store .cse1 |c_~#q~0.base| (store .cse0 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4219 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4219) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse4 (store (select .cse3 |c_~#q~0.base|) .cse2 v_ArrVal_4226))) (or (not (= (select (select (store .cse3 |c_~#q~0.base| .cse4) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse3 |c_~#q~0.base| (store .cse4 .cse5 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4219 (Array Int Int))) (let ((.cse7 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4219) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse7 |c_~#q~0.base|))) (or (= (select .cse6 .cse5) 0) (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-24 01:17:14,302 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4218 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4218) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4218 (Array Int Int))) (let ((.cse5 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4218) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse4 (select .cse5 |c_~#q~0.base|))) (or (< 0 (select .cse4 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse4 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4218 (Array Int Int))) (let ((.cse7 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_4218) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse7 |c_~#q~0.base|))) (or (= (select .cse6 .cse2) 0) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-24 01:17:14,379 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4218 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4218) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4218 (Array Int Int))) (let ((.cse4 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4218) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse5 (select .cse4 |c_~#q~0.base|))) (or (not (= (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (= (select .cse5 .cse2) 0) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_4218 (Array Int Int))) (let ((.cse6 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_4218) |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (select .cse6 |c_~#q~0.base|))) (or (not (= (select (select (store .cse6 |c_~#q~0.base| (store .cse7 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 (select .cse7 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-24 01:17:15,168 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base|) |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| |c_ULTIMATE.start_atomic_exchange_~v#1|)))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse2 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse0 (select .cse2 |c_~#q~0.base|))) (or (= (select .cse0 .cse1) 0) (not (= (select (select (store .cse2 |c_~#q~0.base| (store .cse0 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse5 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (store (select .cse5 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse5 |c_~#q~0.base| .cse6) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse5 |c_~#q~0.base| (store .cse6 .cse1 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse7 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse8 (select .cse7 |c_~#q~0.base|))) (or (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|) (< 0 (select .cse8 (+ 104 |c_~#q~0.offset|))))))))) is different from false [2023-11-24 01:17:15,228 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base|) |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| |c_ULTIMATE.start_atomic_exchange_#in~v#1|)))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse5 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse5 |c_~#q~0.base|))) (or (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse6 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (= (select .cse6 .cse2) 0) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse8 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (select .cse8 |c_~#q~0.base|))) (or (< 0 (select .cse7 (+ 104 |c_~#q~0.offset|))) (not (= (select (select (store .cse8 |c_~#q~0.base| (store .cse7 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-24 01:17:15,286 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base|) |c_ULTIMATE.start_atomic_exchange_#in~obj#1.offset| |c_ULTIMATE.start_atomic_exchange_#in~v#1|)))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse6 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse5 (select .cse6 |c_~#q~0.base|))) (or (< 0 (select .cse5 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (not (= (select (select (store .cse6 |c_~#q~0.base| (store .cse5 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse8 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse7 (select .cse8 |c_~#q~0.base|))) (or (= (select .cse7 .cse2) 0) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (not (= (select (select (store .cse8 |c_~#q~0.base| (store .cse7 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-24 01:17:15,510 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base|) |c_ULTIMATE.start_writeV_~v#1.offset| |c_ULTIMATE.start_writeV_~w#1|)))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse5 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse5 |c_~#q~0.base|))) (or (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse6 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (= (select .cse6 .cse2) 0) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse7 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse8 (select .cse7 |c_~#q~0.base|))) (or (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 (select .cse8 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-24 01:17:15,583 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 32 |c_~#q~0.offset|)) (.cse2 (+ |c_~#q~0.offset| 36)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_writeV_~v#1.base|) |c_ULTIMATE.start_writeV_~v#1.offset| |c_ULTIMATE.start_writeV_#in~w#1|)))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse5 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse5 |c_~#q~0.base|))) (or (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse6 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 (select .cse6 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse7 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse8 (select .cse7 |c_~#q~0.base|))) (or (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (= (select .cse8 .cse2) 0) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-24 01:17:15,658 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse3 (+ 32 |c_~#q~0.offset|)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_writeV_#in~v#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_writeV_#in~v#1.base|) |c_ULTIMATE.start_writeV_#in~v#1.offset| |c_ULTIMATE.start_writeV_#in~w#1|)))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse1 (store (select .cse0 |c_~#q~0.base|) .cse3 v_ArrVal_4226))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse5 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse6 (select .cse5 |c_~#q~0.base|))) (or (not (= (select (select (store .cse5 |c_~#q~0.base| (store .cse6 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (= (select .cse6 .cse2) 0) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse7 (store (store (store .cse4 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222))) (let ((.cse8 (select .cse7 |c_~#q~0.base|))) (or (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse8 .cse3 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 (select .cse8 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-24 01:17:15,791 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36))) (let ((.cse4 (+ 32 |c_~#q~0.offset|)) (.cse3 (store |c_#memory_int| |c_~#q~0.base| (store (select |c_#memory_int| |c_~#q~0.base|) .cse2 0)))) (and (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222)) (.cse1 (store (select (store (store (store .cse3 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222) |c_~#q~0.base|) .cse4 v_ArrVal_4226))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_2)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 1) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|)))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse5 (select (store (store (store .cse3 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222) |c_~#q~0.base|))) (or (not (= (select (select (store (store (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222) |c_~#q~0.base| (store .cse5 .cse4 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (= (select .cse5 .cse2) 0) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|)))) (forall ((|v_ULTIMATE.start_Init_ObjType_~r#1.base_36| Int) (v_ArrVal_4220 (Array Int Int)) (v_ArrVal_4221 (Array Int Int)) (v_ArrVal_4222 (Array Int Int)) (v_ArrVal_4226 Int) (|v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse6 (select (store (store (store .cse3 |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222) |c_~#q~0.base|))) (or (not (= (select (select (store (store (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_4220) |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| v_ArrVal_4221) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_4222) |c_~#q~0.base| (store .cse6 .cse4 v_ArrVal_4226)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) 0)) (< 0 (select .cse6 (+ 104 |c_~#q~0.offset|))) (< 0 |v_StealerThread1of2ForFork0_readV_~#expected~0#1.offset_69|) (< |v_ULTIMATE.start_Init_ObjType_~r#1.base_36| |c_~#items~0.base|))))))) is different from false [2023-11-24 01:17:16,276 INFO L349 Elim1Store]: treesize reduction 58, result has 42.6 percent of original size [2023-11-24 01:17:16,277 INFO L378 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 3 case distinctions, treesize of input 548 treesize of output 433 [2023-11-24 01:17:16,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:17:16,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 12132 treesize of output 11990 [2023-11-24 01:17:16,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:17:16,458 INFO L378 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 1616 treesize of output 1604 [2023-11-24 01:17:16,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:17:16,512 INFO L378 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 1802 treesize of output 1768 [2023-11-24 01:17:16,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:17:16,559 INFO L378 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 2197 treesize of output 2119 [2023-11-24 01:17:18,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-24 01:17:18,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:17:18,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 166 treesize of output 176 [2023-11-24 01:17:18,448 INFO L349 Elim1Store]: treesize reduction 89, result has 11.9 percent of original size [2023-11-24 01:17:18,449 INFO L378 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 1048 treesize of output 780 [2023-11-24 01:17:18,471 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:17:18,472 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:17:18,473 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:17:18,476 INFO L378 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 636 treesize of output 602 [2023-11-24 01:17:18,499 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-24 01:17:18,499 INFO L378 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 1594 treesize of output 1542 [2023-11-24 01:17:18,559 INFO L378 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 615 treesize of output 611 [2023-11-24 01:17:18,584 INFO L378 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 852 treesize of output 836 [2023-11-24 01:17:18,607 INFO L378 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 836 treesize of output 828 [2023-11-24 01:17:18,822 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:17:18,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:17:18,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:17:18,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 548 treesize of output 421 [2023-11-24 01:17:18,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:17:18,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:17:18,844 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:17:18,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:17:18,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 336 treesize of output 320 [2023-11-24 01:17:18,860 INFO L378 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 286 treesize of output 282 [2023-11-24 01:17:18,871 INFO L378 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 282 treesize of output 274 [2023-11-24 01:17:18,884 INFO L378 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 274 treesize of output 272 [2023-11-24 01:17:19,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-24 01:17:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 88 not checked. [2023-11-24 01:17:20,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545663039] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 01:17:20,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 01:17:20,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 43, 49] total 142 [2023-11-24 01:17:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745918991] [2023-11-24 01:17:20,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 01:17:20,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2023-11-24 01:17:20,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:17:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2023-11-24 01:17:20,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=14205, Unknown=55, NotChecked=5180, Total=20022 [2023-11-24 01:17:20,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:17:20,546 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:17:20,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 142 states, 142 states have (on average 5.605633802816901) internal successors, (796), 142 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) [2023-11-24 01:17:20,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:17:20,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:17:20,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:17:20,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:17:20,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:17:20,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:17:20,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:17:20,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:17:20,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:17:20,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:17:20,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:18:55,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-24 01:19:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:19:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:19:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:19:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:19:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-24 01:19:46,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-24 01:19:46,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:19:46,471 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting StealerErr15ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:19:46,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:19:46,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1504838073, now seen corresponding path program 1 times [2023-11-24 01:19:46,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:19:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033246890] [2023-11-24 01:19:46,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:19:46,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:19:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:19:47,299 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 280 proven. 1 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2023-11-24 01:19:47,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:19:47,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033246890] [2023-11-24 01:19:47,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033246890] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:19:47,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036332900] [2023-11-24 01:19:47,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:19:47,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:19:47,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:19:47,305 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 01:19:47,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-24 01:19:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:19:48,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 2477 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 01:19:48,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:19:48,087 INFO L378 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 [2023-11-24 01:19:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2023-11-24 01:19:48,259 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 01:19:48,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036332900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:19:48,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 01:19:48,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-24 01:19:48,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683062889] [2023-11-24 01:19:48,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:19:48,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 01:19:48,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:19:48,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 01:19:48,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:19:48,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:19:48,263 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:19:48,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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) [2023-11-24 01:19:48,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:19:48,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:19:48,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:19:48,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:19:48,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:48,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:48,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:48,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:48,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:48,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:48,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-24 01:19:48,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:19:55,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:19:55,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:19:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:19:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:19:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-24 01:19:55,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:19:55,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-24 01:19:55,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:19:55,788 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting StealerErr15ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:19:55,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:19:55,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1315213550, now seen corresponding path program 1 times [2023-11-24 01:19:55,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:19:55,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102296480] [2023-11-24 01:19:55,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:19:55,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:19:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:19:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 281 proven. 1 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2023-11-24 01:19:56,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:19:56,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102296480] [2023-11-24 01:19:56,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102296480] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:19:56,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648007023] [2023-11-24 01:19:56,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:19:56,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:19:56,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:19:56,359 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 01:19:56,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-24 01:19:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:19:57,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 2488 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 01:19:57,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:19:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2023-11-24 01:19:57,573 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 01:19:57,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648007023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:19:57,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 01:19:57,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-24 01:19:57,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789906523] [2023-11-24 01:19:57,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:19:57,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 01:19:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:19:57,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 01:19:57,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-24 01:19:57,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:19:57,579 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:19:57,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 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) [2023-11-24 01:19:57,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:19:57,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:19:57,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:19:57,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:19:57,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:57,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:57,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:57,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:57,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:57,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:19:57,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-24 01:19:57,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:19:57,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:21:06,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:21:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:21:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:21:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-24 01:21:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:06,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-24 01:21:06,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-24 01:21:06,414 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting StealerErr21ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:21:06,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:21:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash -537960586, now seen corresponding path program 1 times [2023-11-24 01:21:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:21:06,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809565885] [2023-11-24 01:21:06,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:21:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:21:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:21:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-24 01:21:08,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:21:08,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809565885] [2023-11-24 01:21:08,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809565885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:21:08,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:21:08,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-24 01:21:08,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345977872] [2023-11-24 01:21:08,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:21:08,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-24 01:21:08,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:21:08,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-24 01:21:08,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-11-24 01:21:08,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:21:08,494 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:21:08,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.294117647058822) internal successors, (311), 17 states have internal predecessors, (311), 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) [2023-11-24 01:21:08,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:08,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:21:08,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:21:08,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:21:08,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:08,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:08,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:08,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:08,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:08,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:08,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-24 01:21:08,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:08,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:08,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:21:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:21:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:21:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:21:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:21:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:21:18,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-24 01:21:18,046 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting StealerErr14ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:21:18,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:21:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1766512453, now seen corresponding path program 1 times [2023-11-24 01:21:18,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:21:18,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022987590] [2023-11-24 01:21:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:21:18,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:21:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:21:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-24 01:21:22,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:21:22,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022987590] [2023-11-24 01:21:22,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022987590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:21:22,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:21:22,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-24 01:21:22,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369880194] [2023-11-24 01:21:22,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:21:22,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 01:21:22,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:21:22,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 01:21:22,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2023-11-24 01:21:22,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:21:22,425 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:21:22,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 19.76923076923077) internal successors, (257), 14 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) [2023-11-24 01:21:22,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:22,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:21:22,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:21:22,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:21:22,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:22,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:22,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:22,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:22,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:22,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:22,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:21:22,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:22,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:22,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:21:22,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:21:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:21:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:21:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:21:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:21:56,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:56,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:56,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:21:56,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:21:56,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-24 01:21:56,487 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting StealerErr14ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:21:56,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:21:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1146623828, now seen corresponding path program 1 times [2023-11-24 01:21:56,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:21:56,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173067157] [2023-11-24 01:21:56,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:21:56,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:21:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:21:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-24 01:21:57,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:21:57,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173067157] [2023-11-24 01:21:57,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173067157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:21:57,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:21:57,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:21:57,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227955543] [2023-11-24 01:21:57,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:21:57,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 01:21:57,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:21:57,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 01:21:57,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-24 01:21:57,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:21:57,533 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:21:57,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 68.2) internal successors, (341), 6 states have internal predecessors, (341), 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) [2023-11-24 01:21:57,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:57,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:21:57,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:21:57,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:21:57,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:57,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:57,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:57,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:57,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:57,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:57,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:21:57,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:21:57,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:21:57,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:21:57,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:21:57,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:22:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:22:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:22:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:22:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:22:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:03,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:22:03,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:22:03,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:03,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:22:03,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:22:03,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:22:03,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-24 01:22:03,904 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting StealerErr14ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:22:03,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:22:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1250825822, now seen corresponding path program 1 times [2023-11-24 01:22:03,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:22:03,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907008743] [2023-11-24 01:22:03,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:22:03,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:22:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:22:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-24 01:22:06,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:22:06,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907008743] [2023-11-24 01:22:06,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907008743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:22:06,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:22:06,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-24 01:22:06,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837223878] [2023-11-24 01:22:06,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:22:06,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 01:22:06,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:22:06,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 01:22:06,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-24 01:22:06,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:22:06,988 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:22:06,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 39.55555555555556) internal successors, (356), 10 states have internal predecessors, (356), 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) [2023-11-24 01:22:06,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:22:06,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:22:06,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:22:17,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:22:17,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:22:17,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:22:17,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:22:17,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:17,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:17,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:22:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:22:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:22:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:22:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:22:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:22:17,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 01:22:17,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-24 01:22:17,441 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting StealerErr14ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:22:17,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:22:17,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1725952196, now seen corresponding path program 1 times [2023-11-24 01:22:17,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:22:17,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387202394] [2023-11-24 01:22:17,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:22:17,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:22:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:22:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-24 01:22:24,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:22:24,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387202394] [2023-11-24 01:22:24,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387202394] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 01:22:24,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428232414] [2023-11-24 01:22:24,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:22:24,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:22:24,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 01:22:24,747 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 01:22:24,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-24 01:22:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:22:25,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 1692 conjuncts, 178 conjunts are in the unsatisfiable core [2023-11-24 01:22:25,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 01:22:25,696 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 01:22:25,697 INFO L378 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 11 treesize of output 11 [2023-11-24 01:22:26,555 INFO L378 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 [2023-11-24 01:22:26,883 INFO L378 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 16 treesize of output 11 [2023-11-24 01:22:27,048 INFO L378 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 16 treesize of output 11 [2023-11-24 01:22:27,216 INFO L378 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 16 treesize of output 11 [2023-11-24 01:22:27,495 INFO L378 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 16 treesize of output 11 [2023-11-24 01:22:27,673 INFO L378 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 16 treesize of output 11 [2023-11-24 01:22:28,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:22:28,386 INFO L378 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 1 case distinctions, treesize of input 30 treesize of output 21 [2023-11-24 01:22:30,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:22:30,665 INFO L378 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 1 case distinctions, treesize of input 28 treesize of output 30 [2023-11-24 01:22:32,996 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 01:22:32,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 36 [2023-11-24 01:22:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-24 01:22:34,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 01:22:34,628 INFO L349 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2023-11-24 01:22:34,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 205 treesize of output 242 [2023-11-24 01:22:34,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:22:34,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 193 treesize of output 214 [2023-11-24 01:22:34,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:22:34,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 208 [2023-11-24 01:22:34,758 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-24 01:22:34,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 149 [2023-11-24 01:22:34,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:22:34,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 143 treesize of output 137 [2023-11-24 01:22:34,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-11-24 01:22:34,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-11-24 01:22:35,297 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base|))) (let ((.cse2 (= (select .cse0 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset|) (select (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base|) |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.offset|))) (.cse1 (+ |c_StealerThread1of2ForFork0_Steal_~h~0#1| 1))) (and (or (forall ((v_DerPreprocessor_11 Int)) (< (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base| (store .cse0 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset| v_DerPreprocessor_11)) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) .cse1)) (not .cse2)) (or .cse2 (forall ((v_DerPreprocessor_12 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base| v_DerPreprocessor_12) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) .cse1)))))) is different from false [2023-11-24 01:22:35,320 INFO L378 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 5 [2023-11-24 01:23:04,296 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_8705 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)))) (= (select .cse1 .cse3) 0))))) (forall ((v_ArrVal_8705 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_DerPreprocessor_11 Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int)) (let ((.cse5 (select .cse4 |c_~#q~0.base|)) (.cse7 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) (let ((.cse6 (store .cse5 .cse2 .cse7))) (or (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (not (= (select (select (store .cse4 |c_~#q~0.base| .cse6) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0)) (< (select (select (store .cse4 |c_~#q~0.base| (store .cse6 .cse3 v_DerPreprocessor_11)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) .cse7))))) (not (= (select (select .cse4 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-11-24 01:23:05,158 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_8705 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_8704 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_DerPreprocessor_11 Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int)) (let ((.cse1 (select .cse0 |c_~#q~0.base|)) (.cse5 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) (let ((.cse3 (store .cse1 .cse2 .cse5))) (or (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse3 .cse4 v_DerPreprocessor_11)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) .cse5) (not (= 0 (select (select (store .cse0 |c_~#q~0.base| .cse3) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0))))))) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse6 (select .cse7 |c_~#q~0.base|))) (or (= (select .cse6 .cse4) 0) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse2 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)) (not (= (select (select .cse7 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)))))))))) is different from false [2023-11-24 01:23:14,172 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8703 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_8703) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)))) (= (select .cse1 .cse3) 0))))) (forall ((v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8703 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_8704 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_8703) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_DerPreprocessor_11 Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int)) (let ((.cse7 (select .cse4 |c_~#q~0.base|)) (.cse6 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) (let ((.cse5 (store .cse7 .cse2 .cse6))) (or (not (= (select (select (store .cse4 |c_~#q~0.base| .cse5) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0)) (< (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_DerPreprocessor_11)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) .cse6) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse4 |c_~#q~0.base| (store .cse7 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)))))) (not (= (select (select .cse4 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-11-24 01:23:14,232 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8703 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_8703) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)))) (= (select .cse1 .cse3) 0))))) (forall ((v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8703 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_8704 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_8703) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (not (= (select (select .cse4 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_DerPreprocessor_11 Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int)) (let ((.cse6 (select .cse4 |c_~#q~0.base|)) (.cse7 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) (let ((.cse5 (store .cse6 .cse2 .cse7))) (or (not (= (select (select (store .cse4 |c_~#q~0.base| .cse5) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0)) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse4 |c_~#q~0.base| (store .cse6 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (< (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_DerPreprocessor_11)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) .cse7)))))))))) is different from false [2023-11-24 01:23:44,141 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#q~0.offset| 36)) (.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_8701 (Array Int Int)) (v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_8701) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse1 (select .cse0 |c_~#q~0.base|))) (or (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)) (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)))) (= (select .cse1 .cse3) 0))))) (forall ((v_ArrVal_8701 (Array Int Int)) (v_ArrVal_8705 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_8704 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_8701) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (not (= (select (select .cse4 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_DerPreprocessor_11 Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int)) (let ((.cse7 (select .cse4 |c_~#q~0.base|)) (.cse6 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) (let ((.cse5 (store .cse7 .cse2 .cse6))) (or (not (= (select (select (store .cse4 |c_~#q~0.base| .cse5) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0)) (< (select (select (store .cse4 |c_~#q~0.base| (store .cse5 .cse3 v_DerPreprocessor_11)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) .cse6) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse4 |c_~#q~0.base| (store .cse7 .cse2 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0))))))))))) is different from false [2023-11-24 01:23:44,207 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#q~0.offset| 36)) (.cse5 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_8701 (Array Int Int)) (v_ArrVal_8705 (Array Int Int)) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int) (v_ArrVal_8704 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_8701) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (or (not (= (select (select .cse0 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87| Int) (v_DerPreprocessor_11 Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int)) (let ((.cse4 (select .cse0 |c_~#q~0.base|)) (.cse3 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) (let ((.cse1 (store .cse4 .cse5 .cse3))) (or (not (= (select (select (store .cse0 |c_~#q~0.base| .cse1) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) 0)) (< (select (select (store .cse0 |c_~#q~0.base| (store .cse1 .cse2 v_DerPreprocessor_11)) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_87|) 0) .cse3) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse0 |c_~#q~0.base| (store .cse4 .cse5 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0))))))))) (forall ((v_ArrVal_8701 (Array Int Int)) (v_ArrVal_8705 (Array Int Int)) (v_ArrVal_8704 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_8701) |c_~#items~0.base| v_ArrVal_8704) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_8705))) (let ((.cse6 (select .cse7 |c_~#q~0.base|))) (or (= (select .cse6 .cse2) 0) (forall ((|v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86| Int) (v_ArrVal_8706 Int) (|v_StealerThread1of2ForFork0_Steal_~h~0#1_44| Int) (|StealerThread1of2ForFork0_readV_~#expected~0#1.base| Int)) (or (not (= (select (select .cse7 |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0) 0)) (< |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse5 v_ArrVal_8706)) |StealerThread1of2ForFork0_readV_~#expected~0#1.base|) 0)) (not (= (select (select (store .cse7 |c_~#q~0.base| (store .cse6 .cse5 (+ |v_StealerThread1of2ForFork0_Steal_~h~0#1_44| 1))) |v_StealerThread1of2ForFork0_readV_~#expected~0#1.base_86|) 0) 0)))))))))) is different from false [2023-11-24 01:23:44,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:23:44,716 INFO L378 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 1 case distinctions, treesize of input 139 treesize of output 99 [2023-11-24 01:23:44,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:23:44,767 INFO L378 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 15719 treesize of output 15301 [2023-11-24 01:23:44,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:23:44,883 INFO L378 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 1419 treesize of output 1391 [2023-11-24 01:23:44,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:23:44,936 INFO L378 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 1600 treesize of output 1534 [2023-11-24 01:23:45,135 INFO L378 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 6 treesize of output 4 [2023-11-24 01:23:45,745 INFO L378 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 6 treesize of output 4 [2023-11-24 01:23:45,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:23:45,779 INFO L378 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 13 treesize of output 17 [2023-11-24 01:23:45,846 INFO L378 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 6 treesize of output 4 [2023-11-24 01:23:45,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:23:45,871 INFO L378 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 13 treesize of output 17 [2023-11-24 01:23:45,893 INFO L378 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 6 treesize of output 4 [2023-11-24 01:23:45,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:23:45,949 INFO L378 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 13 treesize of output 17 [2023-11-24 01:23:45,973 INFO L378 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 6 treesize of output 4 [2023-11-24 01:23:51,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:23:51,127 INFO L378 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 174 treesize of output 178 [2023-11-24 01:23:51,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:23:51,311 INFO L378 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 54 treesize of output 54 [2023-11-24 01:23:51,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 01:23:51,389 INFO L378 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 1 case distinctions, treesize of input 170 treesize of output 122 [2023-11-24 01:23:51,393 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:23:51,394 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 01:23:51,447 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-11-24 01:23:51,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 925 treesize of output 885 [2023-11-24 01:23:51,474 INFO L378 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 430 treesize of output 414 [2023-11-24 01:23:51,491 INFO L378 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 342 treesize of output 334 [2023-11-24 01:23:51,681 INFO L378 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 72 treesize of output 68 [2023-11-24 01:23:51,812 INFO L378 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 72 [2023-11-24 01:23:52,201 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 01:23:52,201 INFO L378 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 120 treesize of output 110 [2023-11-24 01:23:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 56 not checked. [2023-11-24 01:23:54,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428232414] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 01:23:54,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 01:23:54,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 47, 52] total 139 [2023-11-24 01:23:54,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856971953] [2023-11-24 01:23:54,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 01:23:54,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2023-11-24 01:23:54,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:23:54,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2023-11-24 01:23:54,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=16287, Unknown=401, NotChecked=1862, Total=19182 [2023-11-24 01:23:54,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:23:54,529 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:23:54,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 139 states have (on average 6.374100719424461) internal successors, (886), 139 states have internal predecessors, (886), 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) [2023-11-24 01:23:54,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:23:54,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:23:54,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:23:54,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:23:54,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:54,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:54,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:54,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:54,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:54,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:54,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:23:54,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:23:54,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:23:54,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:23:54,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:23:54,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:23:54,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 01:23:54,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:25:12,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 01:25:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:25:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 01:25:28,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-11-24 01:25:28,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-24 01:25:28,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 01:25:28,797 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting StealerErr21ASSERT_VIOLATIONDATA_RACE === [StealerErr0ASSERT_VIOLATIONDATA_RACE, StealerErr1ASSERT_VIOLATIONDATA_RACE, StealerErr2ASSERT_VIOLATIONDATA_RACE, StealerErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-24 01:25:28,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 01:25:28,797 INFO L85 PathProgramCache]: Analyzing trace with hash 978643178, now seen corresponding path program 1 times [2023-11-24 01:25:28,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 01:25:28,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499217564] [2023-11-24 01:25:28,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 01:25:28,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 01:25:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 01:25:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-24 01:25:29,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 01:25:29,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499217564] [2023-11-24 01:25:29,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499217564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 01:25:29,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 01:25:29,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 01:25:29,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346459208] [2023-11-24 01:25:29,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 01:25:29,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 01:25:29,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 01:25:29,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 01:25:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 01:25:29,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 01:25:29,221 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 01:25:29,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 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) [2023-11-24 01:25:29,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:25:29,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 01:25:29,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:25:29,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 01:25:29,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:25:29,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:25:29,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:25:29,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:25:29,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:25:29,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:25:29,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-11-24 01:25:29,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 01:25:29,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 01:25:29,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-24 01:25:29,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-24 01:25:29,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 01:25:29,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 01:25:29,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2023-11-24 01:25:29,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15