./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version fbcb9f20 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-race-challenges/per-thread-array-ptr.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 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f --- Real Ultimate output --- This is Ultimate 0.2.3-?-fbcb9f2-m [2023-11-24 07:23:42,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 07:23:42,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-24 07:23:42,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 07:23:42,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 07:23:43,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 07:23:43,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 07:23:43,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 07:23:43,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 07:23:43,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 07:23:43,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 07:23:43,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 07:23:43,015 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 07:23:43,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 07:23:43,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 07:23:43,017 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 07:23:43,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 07:23:43,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 07:23:43,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 07:23:43,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 07:23:43,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 07:23:43,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 07:23:43,019 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-24 07:23:43,019 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 07:23:43,020 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 07:23:43,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 07:23:43,020 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 07:23:43,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 07:23:43,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 07:23:43,020 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-24 07:23:43,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 07:23:43,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 07:23:43,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 07:23:43,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 07:23:43,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 07:23:43,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 07:23:43,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 07:23:43,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 07:23:43,022 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-24 07:23:43,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 07:23:43,022 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 07:23:43,024 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 07:23:43,024 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 07:23:43,024 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 -> 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f [2023-11-24 07:23:43,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 07:23:43,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 07:23:43,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 07:23:43,270 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 07:23:43,271 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 07:23:43,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.i [2023-11-24 07:23:44,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 07:23:44,781 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 07:23:44,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.i [2023-11-24 07:23:44,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0aa0d90e2/cfdd1f81beb8462d9eafaf51c7b0cdb8/FLAGdc2d93581 [2023-11-24 07:23:44,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0aa0d90e2/cfdd1f81beb8462d9eafaf51c7b0cdb8 [2023-11-24 07:23:44,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 07:23:44,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 07:23:44,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 07:23:44,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 07:23:44,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 07:23:44,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 07:23:44" (1/1) ... [2023-11-24 07:23:44,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f4c9830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 07:23:44, skipping insertion in model container [2023-11-24 07:23:44,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 07:23:44" (1/1) ... [2023-11-24 07:23:44,878 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 07:23:45,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 07:23:45,297 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 07:23:45,358 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 07:23:45,418 INFO L206 MainTranslator]: Completed translation [2023-11-24 07:23:45,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 07:23:45 WrapperNode [2023-11-24 07:23:45,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 07:23:45,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 07:23:45,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 07:23:45,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 07:23:45,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 07:23:45" (1/1) ... [2023-11-24 07:23:45,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 07:23:45" (1/1) ... [2023-11-24 07:23:45,469 INFO L138 Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-24 07:23:45,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 07:23:45,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 07:23:45,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 07:23:45,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 07:23:45,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 07:23:45" (1/1) ... [2023-11-24 07:23:45,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 07:23:45" (1/1) ... [2023-11-24 07:23:45,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 07:23:45" (1/1) ... [2023-11-24 07:23:45,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 07:23:45" (1/1) ... [2023-11-24 07:23:45,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 07:23:45" (1/1) ... [2023-11-24 07:23:45,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 07:23:45" (1/1) ... [2023-11-24 07:23:45,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 07:23:45" (1/1) ... [2023-11-24 07:23:45,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 07:23:45" (1/1) ... [2023-11-24 07:23:45,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 07:23:45,515 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 07:23:45,515 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 07:23:45,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 07:23:45,516 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 07:23:45" (1/1) ... [2023-11-24 07:23:45,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 07:23:45,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:23:45,546 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 07:23:45,549 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 07:23:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 07:23:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 07:23:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 07:23:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-24 07:23:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 07:23:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 07:23:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 07:23:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-24 07:23:45,591 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-24 07:23:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 07:23:45,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 07:23:45,593 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 07:23:45,732 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 07:23:45,743 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 07:23:45,992 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 07:23:46,002 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 07:23:46,002 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 07:23:46,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 07:23:46 BoogieIcfgContainer [2023-11-24 07:23:46,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 07:23:46,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 07:23:46,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 07:23:46,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 07:23:46,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 07:23:44" (1/3) ... [2023-11-24 07:23:46,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3368a4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 07:23:46, skipping insertion in model container [2023-11-24 07:23:46,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 07:23:45" (2/3) ... [2023-11-24 07:23:46,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3368a4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 07:23:46, skipping insertion in model container [2023-11-24 07:23:46,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 07:23:46" (3/3) ... [2023-11-24 07:23:46,012 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i [2023-11-24 07:23:46,019 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 07:23:46,028 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 07:23:46,029 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 07:23:46,029 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 07:23:46,163 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-24 07:23:46,236 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 07:23:46,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 07:23:46,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:23:46,239 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 07:23:46,262 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 07:23:46,298 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 07:23:46,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-24 07:23:46,318 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;@eb7576e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 07:23:46,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 07:23:46,629 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:23:46,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:23:46,649 INFO L85 PathProgramCache]: Analyzing trace with hash -118187754, now seen corresponding path program 1 times [2023-11-24 07:23:46,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:23:46,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779677466] [2023-11-24 07:23:46,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:23:46,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:23:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:23:46,967 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 07:23:46,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:23:46,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779677466] [2023-11-24 07:23:46,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779677466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 07:23:46,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 07:23:46,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 07:23:46,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538801138] [2023-11-24 07:23:46,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 07:23:46,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 07:23:46,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:23:47,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 07:23:47,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 07:23:47,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:23:47,013 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:23:47,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 07:23:47,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:23:47,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:23:47,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 07:23:47,040 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:23:47,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:23:47,041 INFO L85 PathProgramCache]: Analyzing trace with hash 108159104, now seen corresponding path program 1 times [2023-11-24 07:23:47,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:23:47,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943209659] [2023-11-24 07:23:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:23:47,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:23:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:23:47,737 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 07:23:47,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:23:47,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943209659] [2023-11-24 07:23:47,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943209659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 07:23:47,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 07:23:47,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 07:23:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263532458] [2023-11-24 07:23:47,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 07:23:47,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 07:23:47,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:23:47,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 07:23:47,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 07:23:47,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:23:47,744 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:23:47,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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 07:23:47,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:23:47,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:23:47,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:23:47,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:23:47,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 07:23:47,924 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:23:47,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:23:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1728096500, now seen corresponding path program 1 times [2023-11-24 07:23:47,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:23:47,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199540959] [2023-11-24 07:23:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:23:47,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:23:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:23:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:23:48,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:23:48,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199540959] [2023-11-24 07:23:48,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199540959] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 07:23:48,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007880102] [2023-11-24 07:23:48,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:23:48,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:23:48,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:23:48,669 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 07:23:48,687 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 07:23:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:23:48,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-24 07:23:48,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 07:23:48,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 07:23:49,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 07:23:49,125 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 07:23:49,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:23:49,177 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-24 07:23:49,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:23:49,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2023-11-24 07:23:49,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:23:49,459 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 43 treesize of output 32 [2023-11-24 07:23:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:23:49,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 07:23:51,707 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2))))))) is different from false [2023-11-24 07:23:56,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-24 07:23:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:23:56,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007880102] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 07:23:56,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 07:23:56,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2023-11-24 07:23:56,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678691950] [2023-11-24 07:23:56,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 07:23:56,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-24 07:23:56,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:23:56,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-24 07:23:56,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=912, Unknown=22, NotChecked=62, Total=1122 [2023-11-24 07:23:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:23:56,131 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:23:56,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.242424242424242) internal successors, (140), 34 states have internal predecessors, (140), 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 07:23:56,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:23:56,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:23:56,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:23:57,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:23:57,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:23:57,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:23:57,161 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 07:23:57,361 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,SelfDestructingSolverStorable2 [2023-11-24 07:23:57,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:23:57,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:23:57,362 INFO L85 PathProgramCache]: Analyzing trace with hash 490517125, now seen corresponding path program 2 times [2023-11-24 07:23:57,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:23:57,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725015392] [2023-11-24 07:23:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:23:57,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:23:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:23:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:23:58,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:23:58,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725015392] [2023-11-24 07:23:58,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725015392] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 07:23:58,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532165200] [2023-11-24 07:23:58,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 07:23:58,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:23:58,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:23:58,178 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 07:23:58,196 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 07:23:58,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 07:23:58,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 07:23:58,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-24 07:23:58,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 07:23:58,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-24 07:23:58,573 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 07:23:58,611 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 07:23:58,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:23:58,660 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-24 07:23:58,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:23:58,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2023-11-24 07:23:58,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:23:58,932 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 43 treesize of output 32 [2023-11-24 07:23:58,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:23:58,968 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 43 treesize of output 32 [2023-11-24 07:23:58,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:23:58,990 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 43 treesize of output 32 [2023-11-24 07:23:59,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:23:59,013 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 43 treesize of output 32 [2023-11-24 07:23:59,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:23:59,258 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 43 treesize of output 32 [2023-11-24 07:23:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:23:59,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 07:23:59,292 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) is different from false [2023-11-24 07:23:59,344 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-24 07:23:59,485 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-24 07:23:59,500 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-24 07:23:59,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-24 07:23:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-24 07:23:59,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532165200] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 07:23:59,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 07:23:59,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2023-11-24 07:23:59,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144543230] [2023-11-24 07:23:59,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 07:23:59,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-24 07:23:59,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:23:59,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-24 07:23:59,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1062, Unknown=4, NotChecked=276, Total=1482 [2023-11-24 07:23:59,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:23:59,867 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:23:59,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.421052631578948) internal successors, (168), 39 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 07:23:59,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:23:59,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:23:59,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:23:59,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:24:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:24:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:24:01,318 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 07:24:01,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:24:01,500 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:24:01,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:24:01,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1939312127, now seen corresponding path program 1 times [2023-11-24 07:24:01,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:24:01,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957695354] [2023-11-24 07:24:01,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:24:01,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:24:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:24:02,573 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 07:24:02,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:24:02,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957695354] [2023-11-24 07:24:02,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957695354] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 07:24:02,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940872151] [2023-11-24 07:24:02,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:24:02,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:24:02,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:24:02,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 07:24:02,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 07:24:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:24:02,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-24 07:24:02,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 07:24:02,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-24 07:24:02,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:02,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2023-11-24 07:24:02,907 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 07:24:02,909 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 15 treesize of output 15 [2023-11-24 07:24:03,468 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-24 07:24:03,469 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 66 [2023-11-24 07:24:03,761 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:24:03,761 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 64 treesize of output 52 [2023-11-24 07:24:03,806 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 07:24:03,875 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 07:24:03,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:03,970 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-24 07:24:04,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:04,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2023-11-24 07:24:04,480 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-24 07:24:04,480 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 63 treesize of output 40 [2023-11-24 07:24:04,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:04,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:24:04,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:04,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:24:04,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:04,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:24:04,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:04,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:24:04,641 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 43 treesize of output 32 [2023-11-24 07:24:04,648 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 07:24:04,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 07:24:04,666 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_432 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-24 07:24:04,857 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse0 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse0 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)))) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse0 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse0 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-24 07:24:04,961 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-24 07:24:05,032 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-24 07:24:08,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:08,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 103 [2023-11-24 07:24:08,126 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 65 treesize of output 63 [2023-11-24 07:24:08,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:08,404 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 163 treesize of output 166 [2023-11-24 07:24:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-24 07:24:08,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940872151] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 07:24:08,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 07:24:08,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 49 [2023-11-24 07:24:08,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113755570] [2023-11-24 07:24:08,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 07:24:08,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-24 07:24:08,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:24:08,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-24 07:24:08,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1866, Unknown=26, NotChecked=364, Total=2450 [2023-11-24 07:24:08,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:08,647 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:24:08,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.4693877551020407) internal successors, (170), 50 states have internal predecessors, (170), 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 07:24:08,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:08,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:24:08,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:24:08,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:24:08,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:13,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:24:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:24:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-24 07:24:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-24 07:24:13,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-24 07:24:13,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:24:13,839 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:24:13,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:24:13,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1804082767, now seen corresponding path program 2 times [2023-11-24 07:24:13,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:24:13,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198161401] [2023-11-24 07:24:13,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:24:13,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:24:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:24:14,801 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 07:24:14,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:24:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198161401] [2023-11-24 07:24:14,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198161401] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 07:24:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299366952] [2023-11-24 07:24:14,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 07:24:14,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:24:14,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:24:14,803 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 07:24:14,804 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 07:24:14,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 07:24:14,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 07:24:14,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-24 07:24:14,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 07:24:14,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-24 07:24:15,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:15,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2023-11-24 07:24:15,183 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 07:24:15,183 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 15 treesize of output 15 [2023-11-24 07:24:16,357 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-24 07:24:16,362 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 78 [2023-11-24 07:24:16,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:16,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:16,387 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 07:24:16,387 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 38 treesize of output 26 [2023-11-24 07:24:16,871 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:24:16,872 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 64 treesize of output 52 [2023-11-24 07:24:16,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:16,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:16,882 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 07:24:16,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2023-11-24 07:24:16,951 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 07:24:17,042 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 07:24:17,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:17,157 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-24 07:24:17,743 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-24 07:24:17,743 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 63 treesize of output 40 [2023-11-24 07:24:17,760 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-24 07:24:17,760 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 29 treesize of output 13 [2023-11-24 07:24:17,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:17,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-24 07:24:17,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-11-24 07:24:17,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:17,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:24:18,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:18,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:24:18,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:18,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:24:18,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2023-11-24 07:24:18,346 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 07:24:18,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 07:24:18,590 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-24 07:24:18,662 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse3 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse6)))))) is different from false [2023-11-24 07:24:18,697 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-24 07:24:18,774 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))))) is different from false [2023-11-24 07:24:20,873 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))))) is different from false [2023-11-24 07:24:23,629 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|)))))) is different from false [2023-11-24 07:24:25,708 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse4 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse9) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|)))))) is different from false [2023-11-24 07:24:25,763 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-24 07:24:25,764 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 838 treesize of output 792 [2023-11-24 07:24:25,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:25,783 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 354 treesize of output 324 [2023-11-24 07:24:25,793 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 240 treesize of output 224 [2023-11-24 07:24:25,973 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:24:25,993 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-24 07:24:25,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 320 treesize of output 247 [2023-11-24 07:24:26,002 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 98 treesize of output 96 [2023-11-24 07:24:26,005 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:24:26,007 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 184 treesize of output 158 [2023-11-24 07:24:26,037 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:24:26,045 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-24 07:24:26,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 336 treesize of output 1 [2023-11-24 07:24:26,053 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:24:26,066 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-24 07:24:26,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 336 treesize of output 1 [2023-11-24 07:24:27,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:27,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 131 [2023-11-24 07:24:27,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:27,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 125 [2023-11-24 07:24:27,248 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 92 treesize of output 90 [2023-11-24 07:24:27,255 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 90 treesize of output 88 [2023-11-24 07:24:32,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:32,282 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 306 treesize of output 323 [2023-11-24 07:24:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-24 07:24:32,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299366952] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 07:24:32,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 07:24:32,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 23] total 60 [2023-11-24 07:24:32,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61080567] [2023-11-24 07:24:32,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 07:24:32,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-24 07:24:32,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:24:32,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-24 07:24:32,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2632, Unknown=14, NotChecked=770, Total=3660 [2023-11-24 07:24:32,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:32,498 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:24:32,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 3.0) internal successors, (180), 61 states have internal predecessors, (180), 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 07:24:32,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:32,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:24:32,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:24:32,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-24 07:24:32,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-24 07:24:32,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:24:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:24:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-24 07:24:39,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-24 07:24:39,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-24 07:24:39,116 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 07:24:39,293 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,SelfDestructingSolverStorable5 [2023-11-24 07:24:39,294 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:24:39,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:24:39,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2115809315, now seen corresponding path program 3 times [2023-11-24 07:24:39,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:24:39,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801627422] [2023-11-24 07:24:39,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:24:39,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:24:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:24:40,961 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 07:24:40,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:24:40,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801627422] [2023-11-24 07:24:40,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801627422] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 07:24:40,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426175998] [2023-11-24 07:24:40,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 07:24:40,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:24:40,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:24:40,963 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 07:24:40,965 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 07:24:41,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-24 07:24:41,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 07:24:41,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-24 07:24:41,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 07:24:41,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-24 07:24:41,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:41,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2023-11-24 07:24:41,216 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 07:24:41,216 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 15 treesize of output 15 [2023-11-24 07:24:41,627 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:24:41,627 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 71 treesize of output 57 [2023-11-24 07:24:41,964 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:24:41,964 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 64 treesize of output 52 [2023-11-24 07:24:41,997 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 07:24:42,073 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 07:24:42,409 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-24 07:24:42,410 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 63 treesize of output 40 [2023-11-24 07:24:42,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:42,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-24 07:24:42,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:42,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-24 07:24:42,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:42,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-24 07:24:42,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:42,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:24:42,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:42,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:24:42,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:42,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:24:42,699 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 43 treesize of output 32 [2023-11-24 07:24:42,708 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 07:24:42,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 07:24:42,846 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-24 07:24:42,911 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-24 07:24:42,927 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-24 07:24:43,064 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_676) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) .cse2 v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_676) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) .cse2 v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_676) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) .cse2 v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_676) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) .cse2 v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-24 07:24:43,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:43,307 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 2 case distinctions, treesize of input 92 treesize of output 97 [2023-11-24 07:24:43,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:43,312 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 121 treesize of output 87 [2023-11-24 07:24:43,314 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 58 treesize of output 50 [2023-11-24 07:24:43,318 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 32 treesize of output 28 [2023-11-24 07:24:43,327 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:24:43,328 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:24:43,331 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-24 07:24:43,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2023-11-24 07:24:43,333 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:24:43,333 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:24:43,334 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:24:43,335 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:24:43,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:43,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 106 [2023-11-24 07:24:43,959 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 68 treesize of output 66 [2023-11-24 07:24:44,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:44,105 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 116 treesize of output 121 [2023-11-24 07:24:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-24 07:24:44,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426175998] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 07:24:44,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 07:24:44,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 50 [2023-11-24 07:24:44,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673567078] [2023-11-24 07:24:44,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 07:24:44,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-24 07:24:44,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:24:44,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-24 07:24:44,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1933, Unknown=54, NotChecked=372, Total=2550 [2023-11-24 07:24:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:44,180 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:24:44,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.4) internal successors, (170), 51 states have internal predecessors, (170), 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 07:24:44,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:44,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:24:44,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:24:44,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-24 07:24:44,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-24 07:24:44,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-24 07:24:44,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:48,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:48,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:24:48,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:24:48,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-24 07:24:48,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-24 07:24:48,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-24 07:24:48,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-24 07:24:48,852 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 07:24:49,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:24:49,035 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:24:49,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:24:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1748119725, now seen corresponding path program 4 times [2023-11-24 07:24:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:24:49,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287877075] [2023-11-24 07:24:49,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:24:49,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:24:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:24:49,954 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 07:24:49,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:24:49,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287877075] [2023-11-24 07:24:49,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287877075] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 07:24:49,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520233956] [2023-11-24 07:24:49,955 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-24 07:24:49,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:24:49,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:24:49,957 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 07:24:49,980 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 07:24:50,276 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-24 07:24:50,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 07:24:50,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-24 07:24:50,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 07:24:50,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-24 07:24:50,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:50,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2023-11-24 07:24:50,471 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 07:24:50,471 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 15 treesize of output 15 [2023-11-24 07:24:50,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-24 07:24:51,093 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-24 07:24:51,096 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 66 [2023-11-24 07:24:51,361 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:24:51,361 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 64 treesize of output 52 [2023-11-24 07:24:51,396 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 07:24:51,660 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 07:24:51,661 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 63 treesize of output 35 [2023-11-24 07:24:51,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:51,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-24 07:24:51,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 07:24:51,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 07:24:51,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-24 07:24:51,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:51,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 07:24:51,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:51,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 07:24:51,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:24:51,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 07:24:51,984 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 37 treesize of output 26 [2023-11-24 07:24:52,024 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 07:24:52,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 07:24:52,038 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_807 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_807 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_807 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_807 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-24 07:24:52,061 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1))))) is different from false [2023-11-24 07:24:52,100 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2))))))) is different from false [2023-11-24 07:24:52,115 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_807 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_807) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-24 07:24:52,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-24 07:24:52,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:52,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 100 [2023-11-24 07:24:52,709 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 65 treesize of output 63 [2023-11-24 07:24:53,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:24:53,085 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 239 treesize of output 256 [2023-11-24 07:24:53,308 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 07:24:53,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520233956] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 07:24:53,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 07:24:53,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 51 [2023-11-24 07:24:53,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55651768] [2023-11-24 07:24:53,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 07:24:53,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-24 07:24:53,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:24:53,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-24 07:24:53,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2061, Unknown=11, NotChecked=380, Total=2652 [2023-11-24 07:24:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:53,320 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:24:53,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.1372549019607843) internal successors, (160), 52 states have internal predecessors, (160), 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 07:24:53,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:53,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:24:53,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:24:53,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-11-24 07:24:53,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-24 07:24:53,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-11-24 07:24:53,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-24 07:24:53,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:59,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:24:59,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:24:59,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:24:59,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-24 07:24:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-24 07:24:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-24 07:24:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-24 07:24:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-24 07:24:59,519 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 07:24:59,699 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,SelfDestructingSolverStorable7 [2023-11-24 07:24:59,700 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:24:59,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:24:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1504699717, now seen corresponding path program 5 times [2023-11-24 07:24:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:24:59,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974753971] [2023-11-24 07:24:59,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:24:59,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:24:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:25:00,784 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 07:25:00,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:25:00,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974753971] [2023-11-24 07:25:00,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974753971] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 07:25:00,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070571015] [2023-11-24 07:25:00,785 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-24 07:25:00,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:25:00,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:25:00,786 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 07:25:00,803 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 07:25:00,926 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 07:25:00,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 07:25:00,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-24 07:25:00,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 07:25:00,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-24 07:25:00,975 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 07:25:00,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-24 07:25:01,078 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-11-24 07:25:01,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2023-11-24 07:25:01,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:01,135 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 07:25:01,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2023-11-24 07:25:01,497 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-24 07:25:01,498 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 62 [2023-11-24 07:25:01,520 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 24 treesize of output 18 [2023-11-24 07:25:01,961 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-24 07:25:01,962 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 71 treesize of output 63 [2023-11-24 07:25:02,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:02,347 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 70 treesize of output 50 [2023-11-24 07:25:02,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 07:25:02,509 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 21 treesize of output 20 [2023-11-24 07:25:02,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:02,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-24 07:25:02,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:02,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-24 07:25:02,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:02,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:25:02,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:02,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:25:02,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:02,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:25:02,738 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 43 treesize of output 32 [2023-11-24 07:25:02,747 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 07:25:02,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 07:25:02,765 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_931 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-24 07:25:02,795 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-24 07:25:02,928 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_931) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1))))))) is different from false [2023-11-24 07:25:03,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:03,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 103 [2023-11-24 07:25:03,456 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 65 treesize of output 63 [2023-11-24 07:25:03,702 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 07:25:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070571015] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 07:25:03,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 07:25:03,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 49 [2023-11-24 07:25:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061720034] [2023-11-24 07:25:03,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 07:25:03,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-24 07:25:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:25:03,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-24 07:25:03,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1934, Unknown=44, NotChecked=276, Total=2450 [2023-11-24 07:25:03,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:03,706 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:25:03,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.204081632653061) internal successors, (157), 50 states have internal predecessors, (157), 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 07:25:03,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:03,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:03,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:25:03,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-11-24 07:25:03,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-11-24 07:25:03,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-24 07:25:03,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-11-24 07:25:03,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-24 07:25:03,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:15,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 07:25:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-24 07:25:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-24 07:25:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-11-24 07:25:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-24 07:25:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-24 07:25:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-24 07:25:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-24 07:25:25,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-11-24 07:25:25,710 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 07:25:25,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:25:25,927 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1] [2023-11-24 07:25:25,931 INFO L307 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2023-11-24 07:25:25,934 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 07:25:25,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 07:25:25,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:25:25,935 INFO L229 MonitoredProcess]: Starting monitored process 10 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 07:25:25,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2023-11-24 07:25:25,955 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 07:25:25,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 07:25:25,956 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;@eb7576e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 07:25:25,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-24 07:25:25,973 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 07:25:25,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:25:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1375234035, now seen corresponding path program 1 times [2023-11-24 07:25:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:25:25,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233393406] [2023-11-24 07:25:25,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:25:25,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:25:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:25:26,014 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 07:25:26,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:25:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233393406] [2023-11-24 07:25:26,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233393406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 07:25:26,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 07:25:26,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 07:25:26,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418638317] [2023-11-24 07:25:26,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 07:25:26,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 07:25:26,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:25:26,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 07:25:26,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 07:25:26,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:26,019 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:25:26,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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 07:25:26,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:26,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:26,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 07:25:26,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 07:25:26,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:25:26,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1948619337, now seen corresponding path program 1 times [2023-11-24 07:25:26,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:25:26,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44060228] [2023-11-24 07:25:26,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:25:26,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:25:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:25:26,163 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 07:25:26,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:25:26,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44060228] [2023-11-24 07:25:26,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44060228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 07:25:26,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 07:25:26,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 07:25:26,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460155988] [2023-11-24 07:25:26,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 07:25:26,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 07:25:26,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:25:26,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 07:25:26,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 07:25:26,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:26,170 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:25:26,171 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 07:25:26,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:26,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:26,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 07:25:26,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 07:25:26,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:25:26,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1614691510, now seen corresponding path program 1 times [2023-11-24 07:25:26,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:25:26,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000998782] [2023-11-24 07:25:26,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:25:26,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:25:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:25:26,429 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 07:25:26,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:25:26,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000998782] [2023-11-24 07:25:26,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000998782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 07:25:26,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 07:25:26,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 07:25:26,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959685198] [2023-11-24 07:25:26,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 07:25:26,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 07:25:26,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:25:26,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 07:25:26,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 07:25:26,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:26,431 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:25:26,432 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 07:25:26,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:26,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:26,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:26,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:26,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 07:25:26,615 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-24 07:25:26,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:25:26,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2097273391, now seen corresponding path program 1 times [2023-11-24 07:25:26,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:25:26,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745529107] [2023-11-24 07:25:26,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:25:26,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:25:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 07:25:26,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 07:25:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 07:25:26,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 07:25:26,763 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 07:25:26,764 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-24 07:25:26,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-24 07:25:26,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-24 07:25:26,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-24 07:25:26,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-24 07:25:26,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-24 07:25:26,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-24 07:25:26,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 07:25:26,772 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-24 07:25:26,772 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-11-24 07:25:26,773 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 07:25:26,773 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-24 07:25:26,821 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-24 07:25:26,831 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 07:25:26,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 07:25:26,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:25:26,852 INFO L229 MonitoredProcess]: Starting monitored process 11 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 07:25:26,883 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 07:25:26,883 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2023-11-24 07:25:26,883 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;@eb7576e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 07:25:26,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 07:25:26,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2023-11-24 07:25:26,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:25:26,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:25:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash -968901882, now seen corresponding path program 1 times [2023-11-24 07:25:26,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:25:26,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696586078] [2023-11-24 07:25:26,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:25:26,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:25:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:25:27,101 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 07:25:27,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:25:27,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696586078] [2023-11-24 07:25:27,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696586078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 07:25:27,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 07:25:27,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 07:25:27,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117944032] [2023-11-24 07:25:27,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 07:25:27,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 07:25:27,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:25:27,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 07:25:27,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 07:25:27,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:27,105 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:25:27,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 07:25:27,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:27,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:27,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 07:25:27,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:25:27,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:25:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1206880, now seen corresponding path program 1 times [2023-11-24 07:25:27,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:25:27,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717761997] [2023-11-24 07:25:27,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:25:27,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:25:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:25:27,612 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 07:25:27,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:25:27,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717761997] [2023-11-24 07:25:27,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717761997] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 07:25:27,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 07:25:27,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 07:25:27,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375782832] [2023-11-24 07:25:27,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 07:25:27,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 07:25:27,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:25:27,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 07:25:27,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 07:25:27,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:27,626 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:25:27,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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 07:25:27,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:27,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:28,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:28,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:28,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 07:25:28,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:25:28,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:25:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash 484097772, now seen corresponding path program 1 times [2023-11-24 07:25:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:25:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124879474] [2023-11-24 07:25:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:25:28,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:25:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:25:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:25:28,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:25:28,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124879474] [2023-11-24 07:25:28,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124879474] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 07:25:28,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810344187] [2023-11-24 07:25:28,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:25:28,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:25:28,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:25:28,702 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 07:25:28,704 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 07:25:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:25:28,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-24 07:25:28,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 07:25:28,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 07:25:28,990 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 07:25:29,017 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 07:25:29,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:29,054 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-24 07:25:29,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:29,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2023-11-24 07:25:29,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:29,239 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 43 treesize of output 32 [2023-11-24 07:25:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:25:29,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 07:25:29,266 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) is different from false [2023-11-24 07:25:29,339 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1226 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-24 07:25:29,352 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1226 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1226 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1226 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1226) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-24 07:25:31,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-24 07:25:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-24 07:25:31,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810344187] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 07:25:31,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 07:25:31,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2023-11-24 07:25:31,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150103088] [2023-11-24 07:25:31,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 07:25:31,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-24 07:25:31,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:25:31,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-24 07:25:31,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=821, Unknown=3, NotChecked=180, Total=1122 [2023-11-24 07:25:31,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:31,514 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:25:31,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.242424242424242) internal successors, (140), 34 states have internal predecessors, (140), 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 07:25:31,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:31,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:31,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:35,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:35,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:35,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:25:35,840 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 07:25:36,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:25:36,032 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:25:36,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:25:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash 127283813, now seen corresponding path program 2 times [2023-11-24 07:25:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:25:36,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299320339] [2023-11-24 07:25:36,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:25:36,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:25:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:25:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:25:37,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:25:37,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299320339] [2023-11-24 07:25:37,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299320339] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 07:25:37,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804920371] [2023-11-24 07:25:37,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 07:25:37,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:25:37,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:25:37,063 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 07:25:37,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-24 07:25:37,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 07:25:37,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 07:25:37,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-24 07:25:37,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 07:25:37,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-24 07:25:37,654 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 07:25:37,702 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 07:25:37,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:37,760 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-24 07:25:37,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:37,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2023-11-24 07:25:38,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:38,094 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 43 treesize of output 32 [2023-11-24 07:25:38,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:38,110 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 43 treesize of output 32 [2023-11-24 07:25:38,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:38,127 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 43 treesize of output 32 [2023-11-24 07:25:38,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:38,157 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 43 treesize of output 32 [2023-11-24 07:25:38,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:38,282 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 43 treesize of output 32 [2023-11-24 07:25:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:25:38,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 07:25:38,308 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1345 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1345 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1345 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1345 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-24 07:25:38,350 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) is different from false [2023-11-24 07:25:38,509 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-24 07:25:38,524 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1344 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1345) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false [2023-11-24 07:25:38,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-24 07:25:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-24 07:25:38,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804920371] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 07:25:38,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 07:25:38,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2023-11-24 07:25:38,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259013107] [2023-11-24 07:25:38,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 07:25:38,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-24 07:25:38,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:25:38,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-24 07:25:38,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1062, Unknown=4, NotChecked=276, Total=1482 [2023-11-24 07:25:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:38,840 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:25:38,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.421052631578948) internal successors, (168), 39 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 07:25:38,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:38,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:38,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:25:38,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:40,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:40,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:40,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:25:40,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:25:40,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-24 07:25:40,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-24 07:25:40,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:25:40,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:25:40,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1664817300, now seen corresponding path program 1 times [2023-11-24 07:25:40,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:25:40,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755075896] [2023-11-24 07:25:40,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:25:40,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:25:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:25:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-24 07:25:40,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:25:40,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755075896] [2023-11-24 07:25:40,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755075896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 07:25:40,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 07:25:40,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 07:25:40,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240270805] [2023-11-24 07:25:40,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 07:25:40,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 07:25:40,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:25:40,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 07:25:40,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 07:25:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:40,540 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:25:40,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 07:25:40,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:40,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:40,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:25:40,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:25:40,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:40,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:25:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:25:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:40,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 07:25:40,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:25:40,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:25:40,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1264413843, now seen corresponding path program 1 times [2023-11-24 07:25:40,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:25:40,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749258587] [2023-11-24 07:25:40,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:25:40,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:25:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:25:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-24 07:25:41,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:25:41,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749258587] [2023-11-24 07:25:41,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749258587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 07:25:41,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 07:25:41,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 07:25:41,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749044291] [2023-11-24 07:25:41,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 07:25:41,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 07:25:41,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:25:41,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 07:25:41,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 07:25:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:41,050 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:25:41,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 07:25:41,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:41,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:41,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:25:41,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:25:41,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:41,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:25:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:25:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:41,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:41,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-24 07:25:41,310 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:25:41,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:25:41,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1206707519, now seen corresponding path program 1 times [2023-11-24 07:25:41,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:25:41,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663509420] [2023-11-24 07:25:41,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:25:41,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:25:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:25:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:25:44,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:25:44,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663509420] [2023-11-24 07:25:44,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663509420] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 07:25:44,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557160477] [2023-11-24 07:25:44,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:25:44,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:25:44,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:25:44,012 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 07:25:44,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-24 07:25:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:25:44,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-24 07:25:44,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 07:25:44,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:44,677 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 07:25:44,694 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:25:44,694 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 59 treesize of output 49 [2023-11-24 07:25:44,920 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:25:44,920 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-11-24 07:25:44,925 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 9 treesize of output 7 [2023-11-24 07:25:44,943 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:25:44,943 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 52 treesize of output 44 [2023-11-24 07:25:45,015 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 07:25:45,083 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 21 treesize of output 20 [2023-11-24 07:25:45,163 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 32 [2023-11-24 07:25:45,263 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 0 case distinctions, treesize of input 39 treesize of output 44 [2023-11-24 07:25:45,893 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:25:45,893 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:25:45,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:45,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 13 [2023-11-24 07:25:46,039 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:25:46,040 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:25:46,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:46,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 13 [2023-11-24 07:25:46,185 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:25:46,186 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:25:46,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:46,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 13 [2023-11-24 07:25:46,326 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:25:46,326 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:25:46,337 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 27 treesize of output 13 [2023-11-24 07:25:46,656 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:25:46,656 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:25:46,666 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 27 treesize of output 13 [2023-11-24 07:25:46,768 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:25:46,769 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:25:46,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:46,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 13 [2023-11-24 07:25:46,886 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:25:46,886 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:25:46,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:46,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 13 [2023-11-24 07:25:46,999 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:25:46,999 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:25:47,009 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 27 treesize of output 13 [2023-11-24 07:25:47,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:47,117 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 29 treesize of output 22 [2023-11-24 07:25:47,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-24 07:25:47,148 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:25:47,148 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 66 treesize of output 54 [2023-11-24 07:25:47,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:47,160 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 51 treesize of output 39 [2023-11-24 07:25:47,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:47,443 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 43 treesize of output 32 [2023-11-24 07:25:47,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:47,468 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 43 treesize of output 32 [2023-11-24 07:25:47,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:47,484 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 43 treesize of output 32 [2023-11-24 07:25:47,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:47,504 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 43 treesize of output 32 [2023-11-24 07:25:47,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:47,624 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 43 treesize of output 32 [2023-11-24 07:25:47,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:47,640 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 43 treesize of output 32 [2023-11-24 07:25:47,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:47,655 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 43 treesize of output 32 [2023-11-24 07:25:47,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:47,671 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 43 treesize of output 32 [2023-11-24 07:25:47,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:47,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:47,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:47,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:25:47,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:47,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-24 07:25:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:25:47,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 07:25:49,064 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1738 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1738 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_1738 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_1738 Int) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-24 07:25:49,297 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-24 07:25:49,593 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-24 07:25:50,030 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse3 .cse1 (store (select .cse3 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))))) is different from false [2023-11-24 07:25:50,133 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse3 .cse1 (store (select .cse3 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2) (= (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-24 07:25:50,175 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse3 .cse1 (store (select .cse3 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))))) is different from false [2023-11-24 07:25:50,306 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) .cse5)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3) (= (select (select (let ((.cse7 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-24 07:25:50,340 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse8 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) .cse4)))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= (select (select (let ((.cse6 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) .cse8))))))) is different from false [2023-11-24 07:25:50,378 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse3 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse9 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse9 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse4))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) .cse6)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse4))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1738 Int) (v_ArrVal_1733 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_19 Int) (v_ArrVal_1737 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1737))) (store .cse8 .cse1 (store (select .cse8 .cse1) v_threadThread2of2ForFork0_~p~0.offset_19 v_ArrVal_1738))) c_threadThread1of2ForFork0_~p~0.base) .cse9))))))) is different from false [2023-11-24 07:25:50,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:50,396 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 4 case distinctions, treesize of input 83 treesize of output 76 [2023-11-24 07:25:50,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:50,408 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 2858 treesize of output 2600 [2023-11-24 07:25:50,436 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 866 treesize of output 802 [2023-11-24 07:25:50,451 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 874 treesize of output 842 [2023-11-24 07:25:51,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:51,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 111 treesize of output 77 [2023-11-24 07:25:51,036 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 07:25:51,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1 [2023-11-24 07:25:51,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:51,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 76 [2023-11-24 07:25:51,052 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:25:51,053 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:25:51,060 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-24 07:25:51,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 264 [2023-11-24 07:25:51,069 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 89 treesize of output 85 [2023-11-24 07:25:51,077 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 193 treesize of output 185 [2023-11-24 07:25:51,083 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 236 treesize of output 178 [2023-11-24 07:25:51,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:51,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 76 [2023-11-24 07:25:51,141 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:25:51,142 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:25:51,152 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-24 07:25:51,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 216 [2023-11-24 07:25:51,164 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 180 treesize of output 172 [2023-11-24 07:25:51,172 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 211 treesize of output 165 [2023-11-24 07:25:51,183 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 86 treesize of output 82 [2023-11-24 07:25:51,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2023-11-24 07:25:51,936 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 10 treesize of output 8 [2023-11-24 07:25:54,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:25:54,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 67 [2023-11-24 07:25:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 55 not checked. [2023-11-24 07:25:54,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557160477] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 07:25:54,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 07:25:54,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 73 [2023-11-24 07:25:54,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537473837] [2023-11-24 07:25:54,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 07:25:54,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-24 07:25:54,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:25:54,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-24 07:25:54,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=3898, Unknown=13, NotChecked=1206, Total=5402 [2023-11-24 07:25:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:54,453 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:25:54,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 3.8904109589041096) internal successors, (284), 74 states have internal predecessors, (284), 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 07:25:54,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:25:54,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:54,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:25:54,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:25:54,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:54,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:25:54,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:26:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:26:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:26:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:26:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-11-24 07:26:10,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-24 07:26:10,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:26:10,272 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:26:10,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:26:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash 720158051, now seen corresponding path program 1 times [2023-11-24 07:26:10,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:26:10,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109396849] [2023-11-24 07:26:10,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:26:10,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:26:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:26:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:26:13,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:26:13,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109396849] [2023-11-24 07:26:13,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109396849] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 07:26:13,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154860219] [2023-11-24 07:26:13,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:26:13,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:26:13,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:26:13,032 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 07:26:13,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-24 07:26:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:26:13,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-24 07:26:13,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 07:26:13,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-24 07:26:13,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:13,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2023-11-24 07:26:13,392 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 07:26:13,392 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 15 treesize of output 15 [2023-11-24 07:26:13,765 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:26:13,765 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 71 treesize of output 57 [2023-11-24 07:26:13,980 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:26:13,980 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 64 treesize of output 52 [2023-11-24 07:26:14,015 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 07:26:14,103 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 07:26:14,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:14,230 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-24 07:26:14,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:14,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2023-11-24 07:26:14,670 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:26:14,671 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:26:14,683 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 27 treesize of output 13 [2023-11-24 07:26:14,764 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:26:14,765 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:26:14,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:14,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 13 [2023-11-24 07:26:14,861 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:26:14,862 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:26:14,872 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 27 treesize of output 13 [2023-11-24 07:26:14,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:14,969 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 43 treesize of output 32 [2023-11-24 07:26:15,296 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:26:15,296 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:26:15,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:15,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 13 [2023-11-24 07:26:15,424 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:26:15,425 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:26:15,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:15,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 13 [2023-11-24 07:26:15,550 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:26:15,551 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:26:15,570 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 27 treesize of output 13 [2023-11-24 07:26:15,665 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:26:15,665 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:26:15,680 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 27 treesize of output 13 [2023-11-24 07:26:15,804 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-24 07:26:15,805 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 66 [2023-11-24 07:26:16,262 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-24 07:26:16,262 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 63 treesize of output 40 [2023-11-24 07:26:16,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:16,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:26:16,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:16,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:26:16,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:16,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:26:16,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:16,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:26:16,435 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 43 treesize of output 32 [2023-11-24 07:26:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:26:16,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 07:26:16,458 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1915 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1915 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1915 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1915 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) is different from false [2023-11-24 07:26:16,619 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) .cse0 v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) .cse0 v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) .cse0 v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) .cse0 v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))) is different from false [2023-11-24 07:26:16,754 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-24 07:26:16,823 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))) is different from false [2023-11-24 07:26:16,874 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-24 07:26:17,044 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-24 07:26:17,064 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-24 07:26:17,084 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse4 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-24 07:26:17,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:17,100 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 4 case distinctions, treesize of input 52 treesize of output 68 [2023-11-24 07:26:17,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:17,109 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 932 treesize of output 750 [2023-11-24 07:26:17,116 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 158 treesize of output 142 [2023-11-24 07:26:17,120 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 68 [2023-11-24 07:26:17,125 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 65 treesize of output 61 [2023-11-24 07:26:17,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:17,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2023-11-24 07:26:17,169 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:26:17,170 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:26:17,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:17,174 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 52 [2023-11-24 07:26:17,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:17,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 68 [2023-11-24 07:26:17,189 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:26:17,190 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:26:17,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:17,195 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 54 [2023-11-24 07:26:17,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:17,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 68 [2023-11-24 07:26:17,210 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:26:17,211 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:26:17,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:17,216 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 54 [2023-11-24 07:26:25,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:25,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4055 treesize of output 3124 [2023-11-24 07:26:25,906 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 288 treesize of output 278 [2023-11-24 07:26:25,912 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 278 treesize of output 268 [2023-11-24 07:26:25,919 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 268 treesize of output 256 [2023-11-24 07:26:26,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:26,159 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 165 treesize of output 168 [2023-11-24 07:26:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2023-11-24 07:26:26,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154860219] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 07:26:26,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 07:26:26,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 24] total 62 [2023-11-24 07:26:26,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343988096] [2023-11-24 07:26:26,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 07:26:26,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-11-24 07:26:26,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:26:26,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-11-24 07:26:26,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2684, Unknown=65, NotChecked=904, Total=3906 [2023-11-24 07:26:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:26:26,257 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:26:26,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 4.032258064516129) internal successors, (250), 63 states have internal predecessors, (250), 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 07:26:26,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:26:26,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:26,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:26:26,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:26:26,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:26,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:26,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-11-24 07:26:26,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:26:32,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:26:32,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:32,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:26:32,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:26:32,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:32,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:32,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-11-24 07:26:32,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-24 07:26:32,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-24 07:26:32,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:26:32,646 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:26:32,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:26:32,646 INFO L85 PathProgramCache]: Analyzing trace with hash -500996372, now seen corresponding path program 1 times [2023-11-24 07:26:32,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:26:32,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891017409] [2023-11-24 07:26:32,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:26:32,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:26:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:26:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-24 07:26:33,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:26:33,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891017409] [2023-11-24 07:26:33,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891017409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 07:26:33,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 07:26:33,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 07:26:33,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164451120] [2023-11-24 07:26:33,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 07:26:33,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 07:26:33,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:26:33,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 07:26:33,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 07:26:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:26:33,014 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:26:33,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 07:26:33,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:26:33,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:33,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:26:33,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:26:33,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:33,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:33,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-11-24 07:26:33,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-24 07:26:33,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:26:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:26:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:26:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:26:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-11-24 07:26:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-24 07:26:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:26:33,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-24 07:26:33,219 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:26:33,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:26:33,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1986516461, now seen corresponding path program 1 times [2023-11-24 07:26:33,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:26:33,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021429972] [2023-11-24 07:26:33,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:26:33,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:26:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:26:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:26:36,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:26:36,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021429972] [2023-11-24 07:26:36,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021429972] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 07:26:36,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073944079] [2023-11-24 07:26:36,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:26:36,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:26:36,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:26:36,308 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 07:26:36,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-24 07:26:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:26:36,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-24 07:26:36,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 07:26:36,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-24 07:26:36,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:36,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2023-11-24 07:26:36,790 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 07:26:36,790 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 15 treesize of output 15 [2023-11-24 07:26:37,453 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-24 07:26:37,454 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 78 [2023-11-24 07:26:37,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:37,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-24 07:26:38,112 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:26:38,112 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 64 treesize of output 52 [2023-11-24 07:26:38,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:38,131 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 20 treesize of output 15 [2023-11-24 07:26:38,194 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 07:26:38,324 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 21 treesize of output 20 [2023-11-24 07:26:38,442 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 32 [2023-11-24 07:26:38,583 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 0 case distinctions, treesize of input 39 treesize of output 44 [2023-11-24 07:26:39,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-24 07:26:39,373 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:26:39,373 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:26:39,395 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 27 treesize of output 13 [2023-11-24 07:26:39,526 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:26:39,527 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:26:39,532 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 27 treesize of output 13 [2023-11-24 07:26:39,679 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:26:39,680 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:26:39,695 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 27 treesize of output 13 [2023-11-24 07:26:39,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:39,825 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 43 treesize of output 32 [2023-11-24 07:26:40,284 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:26:40,284 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:26:40,291 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 27 treesize of output 13 [2023-11-24 07:26:40,428 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:26:40,428 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:26:40,434 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 27 treesize of output 13 [2023-11-24 07:26:40,568 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:26:40,569 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:26:40,574 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 27 treesize of output 13 [2023-11-24 07:26:40,681 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:26:40,681 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:26:40,695 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 27 treesize of output 13 [2023-11-24 07:26:40,853 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-24 07:26:40,854 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 71 [2023-11-24 07:26:41,363 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-24 07:26:41,364 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 70 treesize of output 43 [2023-11-24 07:26:41,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:41,465 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 43 treesize of output 32 [2023-11-24 07:26:41,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:41,491 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 43 treesize of output 32 [2023-11-24 07:26:41,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:41,511 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 43 treesize of output 32 [2023-11-24 07:26:41,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:41,535 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 43 treesize of output 32 [2023-11-24 07:26:41,612 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 43 treesize of output 32 [2023-11-24 07:26:41,631 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 43 treesize of output 32 [2023-11-24 07:26:41,648 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 43 treesize of output 32 [2023-11-24 07:26:41,667 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 43 treesize of output 32 [2023-11-24 07:26:41,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:41,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:41,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:41,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:26:41,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:41,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-24 07:26:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:26:41,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 07:26:43,542 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))) is different from false [2023-11-24 07:26:43,708 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2214))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-24 07:26:43,862 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-24 07:26:44,270 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) .cse1 v_ArrVal_2214))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-24 07:26:44,342 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse1))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse1))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse1))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse1))))) is different from false [2023-11-24 07:26:44,535 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))))) is different from false [2023-11-24 07:26:44,669 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse2))))) is different from false [2023-11-24 07:26:44,874 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))))) is different from false [2023-11-24 07:26:44,993 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-24 07:26:45,047 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2023-11-24 07:26:45,232 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= (select (select (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) .cse7)))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))))) is different from false [2023-11-24 07:26:45,283 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse7 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= (select (select (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) .cse7)))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= (select (select (let ((.cse9 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-24 07:26:45,337 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse10 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse8 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse10 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) .cse5)))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) .cse8)) (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0))) (forall ((v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2215 Int) (v_threadThread2of2ForFork0_~p~0.offset_22 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2210) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2206) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2214))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~p~0.offset_22 v_ArrVal_2215))) c_threadThread1of2ForFork0_~p~0.base) .cse10))))))) is different from false [2023-11-24 07:26:45,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:45,366 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 4 case distinctions, treesize of input 111 treesize of output 104 [2023-11-24 07:26:45,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:45,427 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 1209846 treesize of output 1111478 [2023-11-24 07:26:45,791 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 3456 treesize of output 3328 [2023-11-24 07:26:45,866 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 3472 treesize of output 3408 [2023-11-24 07:26:45,936 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 3984 treesize of output 3728 [2023-11-24 07:26:50,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:50,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 161 treesize of output 127 [2023-11-24 07:26:50,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:50,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 104 [2023-11-24 07:26:50,430 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:26:50,430 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:26:50,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:50,459 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 18106 treesize of output 16890 [2023-11-24 07:26:50,493 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 1118 treesize of output 1054 [2023-11-24 07:26:50,513 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 499 treesize of output 491 [2023-11-24 07:26:50,591 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 563 treesize of output 547 [2023-11-24 07:26:51,263 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 265 treesize of output 207 [2023-11-24 07:26:51,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:51,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 104 [2023-11-24 07:26:51,337 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:26:51,338 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:26:51,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:51,355 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 19502 treesize of output 18030 [2023-11-24 07:26:51,391 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 1072 treesize of output 1008 [2023-11-24 07:26:51,409 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 485 treesize of output 477 [2023-11-24 07:26:51,431 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 547 treesize of output 531 [2023-11-24 07:26:52,433 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 192 treesize of output 146 [2023-11-24 07:26:52,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:52,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 102 [2023-11-24 07:26:52,506 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:26:52,507 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:26:52,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:26:52,521 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 4784 treesize of output 4436 [2023-11-24 07:26:52,632 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 1111 treesize of output 1079 [2023-11-24 07:26:52,654 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 563 treesize of output 559 [2023-11-24 07:26:52,679 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 598 treesize of output 590 [2023-11-24 07:26:52,971 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 215 treesize of output 177 [2023-11-24 07:26:55,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 887 treesize of output 875 [2023-11-24 07:27:01,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:27:01,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 99272 treesize of output 64087 [2023-11-24 07:27:03,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:27:03,822 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 10069 treesize of output 10064 [2023-11-24 07:27:04,174 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 10055 treesize of output 10047 [2023-11-24 07:27:04,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:27:04,477 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 10047 treesize of output 10030 [2023-11-24 07:27:04,742 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 10021 treesize of output 9991 [2023-11-24 07:27:05,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:27:05,034 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 9991 treesize of output 9936 [2023-11-24 07:27:05,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:27:05,304 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 9927 treesize of output 9904 [2023-11-24 07:27:05,545 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 9895 treesize of output 9893 [2023-11-24 07:27:05,806 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 9893 treesize of output 9891 [2023-11-24 07:27:06,058 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 9891 treesize of output 9883 [2023-11-24 07:27:06,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:27:06,331 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 9883 treesize of output 9880 [2023-11-24 07:27:06,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:27:06,619 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 9871 treesize of output 9858 [2023-11-24 07:27:06,885 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 9849 treesize of output 9733 [2023-11-24 07:27:07,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:27:07,163 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 9733 treesize of output 9528 [2023-11-24 07:27:07,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:27:07,453 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 9519 treesize of output 9108 [2023-11-24 07:27:07,702 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 9099 treesize of output 9093 [2023-11-24 07:27:08,009 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 9093 treesize of output 9081 [2023-11-24 07:27:08,348 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 9081 treesize of output 9075 [2023-11-24 07:27:08,671 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 9075 treesize of output 8877 [2023-11-24 07:27:08,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:27:08,993 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 8877 treesize of output 8412 [2023-11-24 07:27:09,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:27:09,349 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 8403 treesize of output 8212 [2023-11-24 07:27:09,754 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 8203 treesize of output 8173 [2023-11-24 07:27:10,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:27:10,187 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 8173 treesize of output 8094 [2023-11-24 07:27:10,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:27:10,645 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 8085 treesize of output 8050 [2023-11-24 07:27:50,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:27:50,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 933 treesize of output 1068 [2023-11-24 07:27:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2023-11-24 07:27:52,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073944079] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 07:27:52,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 07:27:52,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 31] total 83 [2023-11-24 07:27:52,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67454108] [2023-11-24 07:27:52,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 07:27:52,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2023-11-24 07:27:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:27:52,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2023-11-24 07:27:52,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=4651, Unknown=28, NotChecked=1950, Total=6972 [2023-11-24 07:27:52,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:27:52,170 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:27:52,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 83 states have (on average 3.3734939759036147) internal successors, (280), 84 states have internal predecessors, (280), 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 07:27:52,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:27:52,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:27:52,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 07:27:52,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:27:52,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:27:52,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:27:52,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-11-24 07:27:52,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-24 07:27:52,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:27:52,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:28:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:28:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:28:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:28:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-24 07:28:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:28:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:28:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-11-24 07:28:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-24 07:28:22,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:28:22,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-11-24 07:28:22,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-24 07:28:22,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:28:22,664 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:28:22,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:28:22,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1081034471, now seen corresponding path program 2 times [2023-11-24 07:28:22,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:28:22,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222982876] [2023-11-24 07:28:22,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:28:22,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:28:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:28:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:28:25,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:28:25,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222982876] [2023-11-24 07:28:25,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222982876] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 07:28:25,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238637257] [2023-11-24 07:28:25,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 07:28:25,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:28:25,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:28:25,677 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 07:28:25,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-24 07:28:25,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 07:28:25,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 07:28:25,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-24 07:28:25,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 07:28:26,443 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:28:26,443 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 59 treesize of output 49 [2023-11-24 07:28:26,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:26,452 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 07:28:26,767 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:28:26,768 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 52 treesize of output 44 [2023-11-24 07:28:26,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:26,778 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 20 treesize of output 15 [2023-11-24 07:28:26,806 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 07:28:26,888 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 21 treesize of output 20 [2023-11-24 07:28:26,972 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 32 [2023-11-24 07:28:27,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-24 07:28:27,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:28:27,457 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 51 treesize of output 39 [2023-11-24 07:28:27,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:27,550 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 34 treesize of output 25 [2023-11-24 07:28:27,568 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 0 case distinctions, treesize of input 39 treesize of output 44 [2023-11-24 07:28:27,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:27,655 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 43 treesize of output 32 [2023-11-24 07:28:27,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:27,679 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 43 treesize of output 32 [2023-11-24 07:28:27,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:27,698 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 43 treesize of output 32 [2023-11-24 07:28:27,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:27,791 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 43 treesize of output 32 [2023-11-24 07:28:27,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:27,812 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 43 treesize of output 32 [2023-11-24 07:28:27,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:27,832 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 43 treesize of output 32 [2023-11-24 07:28:27,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:27,855 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 43 treesize of output 32 [2023-11-24 07:28:28,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:28,119 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 43 treesize of output 32 [2023-11-24 07:28:28,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:28,134 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 43 treesize of output 32 [2023-11-24 07:28:28,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:28,153 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 43 treesize of output 32 [2023-11-24 07:28:28,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:28,175 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 43 treesize of output 32 [2023-11-24 07:28:28,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:28,300 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 43 treesize of output 32 [2023-11-24 07:28:28,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:28,313 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 43 treesize of output 32 [2023-11-24 07:28:28,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:28,331 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 43 treesize of output 32 [2023-11-24 07:28:28,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:28,348 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 43 treesize of output 32 [2023-11-24 07:28:28,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:28,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:28,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:28,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:28,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:28:28,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-24 07:28:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:28:28,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 07:28:29,895 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-24 07:28:30,059 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-24 07:28:30,386 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse1))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse1))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse1))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse1))))) is different from false [2023-11-24 07:28:30,706 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= (select (select (let ((.cse1 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse4)) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))))) is different from false [2023-11-24 07:28:30,740 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse2))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse2))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse1)) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse2))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-24 07:28:30,780 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse3)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false [2023-11-24 07:28:30,905 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse3)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2023-11-24 07:28:30,950 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse3)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2023-11-24 07:28:31,094 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse6)) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))))) is different from false [2023-11-24 07:28:31,135 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse8 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse5)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse4)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) .cse8)))) (forall ((v_ArrVal_2418 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_24 Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (v_ArrVal_2435 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2418) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2430) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2434))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~p~0.offset_24 v_ArrVal_2435))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-24 07:28:31,179 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-24 07:28:31,180 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 15414 treesize of output 13208 [2023-11-24 07:28:31,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:28:31,218 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 1122 treesize of output 1024 [2023-11-24 07:28:31,234 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 460 treesize of output 452 [2023-11-24 07:28:31,245 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 820 treesize of output 788 [2023-11-24 07:28:31,257 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 932 treesize of output 868 [2023-11-24 07:28:31,826 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:28:31,826 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:28:31,836 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-24 07:28:31,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1202 treesize of output 1 [2023-11-24 07:28:31,841 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:28:31,842 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:28:31,851 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-24 07:28:31,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1266 treesize of output 1 [2023-11-24 07:28:31,857 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:28:31,858 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:28:31,884 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-24 07:28:31,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 770 treesize of output 745 [2023-11-24 07:28:31,895 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:28:31,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 148 [2023-11-24 07:28:31,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:31,908 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 82 treesize of output 78 [2023-11-24 07:28:32,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2023-11-24 07:28:32,799 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 10 treesize of output 8 [2023-11-24 07:28:35,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:28:35,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 67 [2023-11-24 07:28:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 55 not checked. [2023-11-24 07:28:35,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238637257] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 07:28:35,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 07:28:35,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 27] total 73 [2023-11-24 07:28:35,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047963853] [2023-11-24 07:28:35,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 07:28:35,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-24 07:28:35,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 07:28:35,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-24 07:28:35,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3810, Unknown=14, NotChecked=1330, Total=5402 [2023-11-24 07:28:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:28:35,408 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 07:28:35,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 3.8493150684931505) internal successors, (281), 74 states have internal predecessors, (281), 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 07:28:35,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:28:35,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:28:35,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:28:35,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-11-24 07:28:35,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:28:35,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:28:35,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2023-11-24 07:28:35,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-24 07:28:35,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:28:35,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2023-11-24 07:28:35,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:28:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 07:28:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:28:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 07:28:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-24 07:28:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:28:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:28:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-24 07:28:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-24 07:28:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 07:28:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-11-24 07:28:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-11-24 07:28:52,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-24 07:28:52,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-24 07:28:52,729 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 07:28:52,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 07:28:52,729 INFO L85 PathProgramCache]: Analyzing trace with hash 605097109, now seen corresponding path program 2 times [2023-11-24 07:28:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 07:28:52,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539070091] [2023-11-24 07:28:52,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 07:28:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 07:28:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 07:28:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:28:55,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 07:28:55,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539070091] [2023-11-24 07:28:55,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539070091] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 07:28:55,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031922242] [2023-11-24 07:28:55,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 07:28:55,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 07:28:55,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 07:28:55,178 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 07:28:55,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-24 07:28:55,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 07:28:55,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 07:28:55,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 88 conjunts are in the unsatisfiable core [2023-11-24 07:28:55,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 07:28:55,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-24 07:28:55,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:55,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2023-11-24 07:28:55,746 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 07:28:55,746 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 15 treesize of output 15 [2023-11-24 07:28:56,434 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:28:56,435 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 71 treesize of output 57 [2023-11-24 07:28:56,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:56,440 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 07:28:56,776 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:28:56,776 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-24 07:28:56,780 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 07:28:56,799 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:28:56,800 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 64 treesize of output 52 [2023-11-24 07:28:56,905 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 07:28:57,002 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 21 treesize of output 20 [2023-11-24 07:28:57,116 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 32 [2023-11-24 07:28:57,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-24 07:28:57,803 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:28:57,803 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2023-11-24 07:28:57,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2023-11-24 07:28:57,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:28:57,908 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 39 treesize of output 44 [2023-11-24 07:28:58,042 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:28:58,042 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:28:58,066 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 27 treesize of output 13 [2023-11-24 07:28:58,181 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:28:58,181 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:28:58,194 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 27 treesize of output 13 [2023-11-24 07:28:58,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:28:58,296 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 43 treesize of output 32 [2023-11-24 07:28:58,750 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:28:58,750 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:28:58,758 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 27 treesize of output 13 [2023-11-24 07:28:58,939 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:28:58,939 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:28:58,946 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 27 treesize of output 13 [2023-11-24 07:28:59,080 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:28:59,080 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:28:59,098 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 27 treesize of output 13 [2023-11-24 07:28:59,252 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 07:28:59,252 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2023-11-24 07:28:59,274 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 27 treesize of output 13 [2023-11-24 07:28:59,456 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 07:28:59,456 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 78 treesize of output 62 [2023-11-24 07:28:59,982 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-24 07:28:59,983 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 70 treesize of output 43 [2023-11-24 07:29:00,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:29:00,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:29:00,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:29:00,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:29:00,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:29:00,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:29:00,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:29:00,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 07:29:00,258 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 43 treesize of output 32 [2023-11-24 07:29:00,279 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 43 treesize of output 32 [2023-11-24 07:29:00,291 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 43 treesize of output 32 [2023-11-24 07:29:00,309 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 43 treesize of output 32 [2023-11-24 07:29:00,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:29:00,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:29:00,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:29:00,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 07:29:00,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:00,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-24 07:29:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 07:29:00,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 07:29:03,940 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-24 07:29:04,058 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2645))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-24 07:29:04,147 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse1 v_ArrVal_2645))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse1 v_ArrVal_2645))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse1 v_ArrVal_2645))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse1 v_ArrVal_2645))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))))) is different from false [2023-11-24 07:29:04,445 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse2 v_ArrVal_2645))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse2 v_ArrVal_2645))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse2 v_ArrVal_2645))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) .cse2 v_ArrVal_2645))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-24 07:29:04,489 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0))))) is different from false [2023-11-24 07:29:04,717 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse2))))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))))) is different from false [2023-11-24 07:29:04,882 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1))) (< .cse2 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (< .cse2 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (< .cse2 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (< .cse2 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))))) is different from false [2023-11-24 07:29:05,012 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse7)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0))) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|)))))) is different from false [2023-11-24 07:29:05,064 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2628 (Array Int Int))) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2628 (Array Int Int))) (or (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= (select (select (let ((.cse4 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2628 (Array Int Int))) (or (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (= (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0))))) (forall ((v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2628 (Array Int Int))) (or (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2647 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))))) is different from false [2023-11-24 07:29:05,146 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse3)) (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse0) (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2023-11-24 07:29:05,312 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse4 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse4))))) is different from false [2023-11-24 07:29:05,402 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse2 .cse3 (store (select .cse2 .cse3) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse5 .cse3 (store (select .cse5 .cse3) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse6 .cse3 (store (select .cse6 .cse3) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse7 .cse3 (store (select .cse7 .cse3) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse4)) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse1))))) is different from false [2023-11-24 07:29:05,714 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse5))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (= (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse7) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse5))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse8 .cse1 (store (select .cse8 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse5))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse9 .cse1 (store (select .cse9 .cse1) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse3)) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse5)))))) is different from false [2023-11-24 07:29:05,781 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse5 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse10 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse6 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (= (select (select (let ((.cse1 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse6))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse6))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse4)) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse6))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_26 Int) (v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (v_ArrVal_2641 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_ArrVal_2647 Int) (v_ArrVal_2628 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2628) c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2641) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2645))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~p~0.offset_26 v_ArrVal_2647))) c_threadThread1of2ForFork0_~p~0.base) .cse10)) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (< v_threadThread2of2ForFork0_~p~0.offset_26 .cse6)))))) is different from false [2023-11-24 07:29:05,883 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-24 07:29:05,886 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 5031032 treesize of output 4465834 [2023-11-24 07:29:06,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:06,179 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 4364 treesize of output 4010 [2023-11-24 07:29:06,373 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 3812 treesize of output 3684 [2023-11-24 07:29:06,435 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 2026 treesize of output 2010 [2023-11-24 07:29:06,530 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 4280 treesize of output 4024 [2023-11-24 07:29:06,640 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 4168 treesize of output 4104 [2023-11-24 07:29:11,230 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:29:11,380 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:29:11,380 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:29:11,414 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-24 07:29:11,415 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 36344 treesize of output 31018 [2023-11-24 07:29:11,454 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 658 treesize of output 650 [2023-11-24 07:29:11,464 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:29:11,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:11,478 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 1134 treesize of output 1072 [2023-11-24 07:29:11,499 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 560 treesize of output 544 [2023-11-24 07:29:11,514 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 1130 treesize of output 1066 [2023-11-24 07:29:12,576 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:29:12,623 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:29:12,623 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:29:12,657 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-24 07:29:12,658 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 34296 treesize of output 28970 [2023-11-24 07:29:12,697 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 650 treesize of output 642 [2023-11-24 07:29:12,717 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 674 treesize of output 670 [2023-11-24 07:29:12,732 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:29:12,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:12,745 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 1250 treesize of output 1148 [2023-11-24 07:29:12,766 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 1206 treesize of output 1174 [2023-11-24 07:29:13,238 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:29:13,238 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:29:13,288 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-24 07:29:13,289 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 28408 treesize of output 27690 [2023-11-24 07:29:13,331 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 07:29:13,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:13,343 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 1014 treesize of output 956 [2023-11-24 07:29:13,360 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 532 treesize of output 516 [2023-11-24 07:29:13,380 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 552 treesize of output 544 [2023-11-24 07:29:13,398 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 1130 treesize of output 1066 [2023-11-24 07:29:15,288 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= c_threadThread1of2ForFork0_~p~0.base |c_ULTIMATE.start_main_~#datas~0#1.base|))) (.cse4 (forall ((v_ArrVal_2621 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) |c_ULTIMATE.start_main_~#tids~0#1.base|)))) (.cse18 (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| c_threadThread1of2ForFork0_~p~0.base)))) (and (forall ((v_ArrVal_2621 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621))) (or (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_prenex_138 (Array Int Int))) (not (= c_threadThread1of2ForFork0_~p~0.base (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_138) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (= (select (select .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)))) (forall ((v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621))) (or (forall ((v_ArrVal_2637 (Array Int Int))) (let ((.cse2 (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= (select (select .cse1 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) .cse2)) (not (= c_threadThread1of2ForFork0_~p~0.base .cse2))))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|)))) (or .cse3 .cse4) (forall ((v_ArrVal_2621 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621))) (or (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (< (select (select .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_prenex_131 (Array Int Int))) (not (= (select (select (store .cse5 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_131) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base))))) (= (select (select .cse5 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)))) (forall ((v_ArrVal_2621 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (or (not (= .cse6 c_threadThread1of2ForFork0_~p~0.base)) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (< (select (select .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_prenex_135 (Array Int Int))) (not (= .cse6 (select (select (store .cse7 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_135) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))))))) (or (forall ((v_ArrVal_2622 (Array Int Int))) (< c_threadThread1of2ForFork0_~p~0.offset (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select (store |c_#memory_$Pointer$.offset| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2622) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 1))) (forall ((v_ArrVal_2621 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)))) (forall ((v_ArrVal_2621 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621))) (or (forall ((v_ArrVal_2637 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (not (= c_threadThread1of2ForFork0_~p~0.base (select (select (store .cse8 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (< (select (select .cse8 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (not (= (select (select .cse8 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) |c_ULTIMATE.start_main_~#datas~0#1.base|))))) (forall ((v_ArrVal_2621 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621))) (or (forall ((v_ArrVal_2637 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (not (= c_threadThread1of2ForFork0_~p~0.base (select (select (store .cse9 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (< (select (select .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (= (select (select .cse9 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)))) (forall ((v_ArrVal_2621 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621))) (or (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_prenex_156 (Array Int Int))) (not (= c_threadThread1of2ForFork0_~p~0.base (select (select (store .cse10 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_156) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (< (select (select .cse10 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|))) (= (select (select .cse10 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)))) (forall ((v_ArrVal_2621 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621))) (or (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_149 (Array Int Int))) (or (< (select (select .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= (select (select (store .cse11 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_149) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)))) (= (select (select .cse11 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)))) (or .cse3 (forall ((v_ArrVal_2621 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) |c_ULTIMATE.start_main_~#tids~0#1.base|))) (forall ((v_ArrVal_2621 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (or (= .cse12 |c_ULTIMATE.start_main_~#datas~0#1.base|) (not (= .cse12 c_threadThread1of2ForFork0_~p~0.base)) (forall ((v_prenex_130 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (not (= .cse12 (select (select (store .cse13 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_130) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (< (select (select .cse13 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|))))))) (forall ((v_ArrVal_2621 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (or (= .cse14 |c_ULTIMATE.start_main_~#datas~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_133 (Array Int Int))) (or (< (select (select .cse15 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= (select (select (store .cse15 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)))) (= .cse14 c_threadThread1of2ForFork0_~p~0.base))))) (forall ((v_ArrVal_2621 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621))) (or (= (select (select .cse16 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) |c_ULTIMATE.start_main_~#tids~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (forall ((v_prenex_137 (Array Int Int))) (not (= c_threadThread1of2ForFork0_~p~0.base (select (select (store .cse16 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_137) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (< (select (select .cse16 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|)))))) (forall ((v_ArrVal_2621 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621))) (or (not (= (select (select .cse17 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) |c_ULTIMATE.start_main_~#tids~0#1.base|)) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (or (< (select (select .cse17 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (forall ((v_prenex_139 (Array Int Int))) (not (= (select (select (store .cse17 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_139) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)))))))) (or .cse18 .cse4) (or (forall ((v_ArrVal_2621 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_2621) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) c_threadThread1of2ForFork0_~p~0.base)) .cse18))) is different from false [2023-11-24 07:29:16,383 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (forall ((v_ArrVal_2621 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) |c_ULTIMATE.start_main_~#tids~0#1.base|)))) (.cse0 (not (= |c_threadThread1of2ForFork0_#in~arg.base| |c_ULTIMATE.start_main_~#tids~0#1.base|))) (.cse7 (not (= |c_threadThread1of2ForFork0_#in~arg.base| |c_ULTIMATE.start_main_~#datas~0#1.base|)))) (and (or (forall ((v_ArrVal_2621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) .cse0) (forall ((v_ArrVal_2621 (Array Int Int)) (v_prenex_130 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (or (< (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= .cse2 (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_130) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (= .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base|) (not (= |c_threadThread1of2ForFork0_#in~arg.base| .cse2)))))) (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621))) (or (< (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= (select (select .cse3 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) |c_ULTIMATE.start_main_~#datas~0#1.base|)) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store .cse3 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621))) (let ((.cse5 (select (select (store .cse4 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (< (select (select .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= |c_threadThread1of2ForFork0_#in~arg.base| .cse5)) (not (= (select (select .cse4 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) .cse5)))))) (forall ((v_ArrVal_2621 (Array Int Int)) (v_prenex_131 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621))) (or (< (select (select .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store .cse6 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_131) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select .cse6 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))))) (or .cse7 .cse8) (forall ((v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_149 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621))) (or (< (select (select .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store .cse9 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_149) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select .cse9 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))))) (or (forall ((v_ArrVal_2622 (Array Int Int))) (< |c_threadThread1of2ForFork0_#in~arg.offset| (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 1 (select (select (store |c_#memory_$Pointer$.offset| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2622) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)))) (forall ((v_ArrVal_2621 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))))) (forall ((v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_139 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621))) (or (< (select (select .cse10 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store .cse10 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_139) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= (select (select .cse10 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) |c_ULTIMATE.start_main_~#tids~0#1.base|))))) (forall ((v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_156 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621))) (or (< (select (select .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select .cse11 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store .cse11 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_156) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (or .cse8 .cse0) (forall ((v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_137 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621))) (or (< (select (select .cse12 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (= (select (select .cse12 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) |c_ULTIMATE.start_main_~#tids~0#1.base|) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store .cse12 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_137) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621))) (or (< (select (select .cse13 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store .cse13 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select .cse13 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))))) (or .cse7 (forall ((v_ArrVal_2621 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) |c_ULTIMATE.start_main_~#tids~0#1.base|))) (forall ((v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_138 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621))) (or (< (select (select .cse14 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= (select (select (store .cse14 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_138) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_threadThread1of2ForFork0_#in~arg.base|)) (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select .cse14 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))))) (forall ((v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_133 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (or (< (select (select .cse15 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store .cse15 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (= .cse16 |c_ULTIMATE.start_main_~#datas~0#1.base|) (= |c_threadThread1of2ForFork0_#in~arg.base| .cse16))))) (forall ((v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_135 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2621))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (or (< (select (select .cse17 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= .cse18 (select (select (store .cse17 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_135) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| .cse18)))))))) is different from false [2023-11-24 07:29:17,131 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| |c_ULTIMATE.start_main_~#datas~0#1.base|))) (.cse3 (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|))) (.cse13 (forall ((v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)))))) (and (forall ((v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_138 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_138) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (forall ((v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_139 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621))) (or (< (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| (select (select .cse1 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_139) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (forall ((v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_149 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (< (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store .cse2 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_149) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (or (forall ((v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) .cse3) (or .cse4 (forall ((v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int))) (= |c_ULTIMATE.start_main_~#tids~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)))) (forall ((v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_133 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (or (= .cse5 |c_ULTIMATE.start_main_~#datas~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse5) (< (select (select .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= (select (select (store .cse6 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|)))))) (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621))) (or (not (= (select (select (store .cse7 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|)) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select .cse7 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (< (select (select .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|)))) (forall ((v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_137 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621))) (or (< (select (select .cse8 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= (select (select (store .cse8 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_137) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|)) (= |c_ULTIMATE.start_main_~#tids~0#1.base| (select (select .cse8 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))))) (forall ((v_ArrVal_2621 (Array Int Int)) (v_prenex_130 (Array Int Int)) (v_ArrVal_2620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (or (= .cse9 |c_ULTIMATE.start_main_~#datas~0#1.base|) (not (= (select (select (store .cse10 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_130) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) .cse9)) (< (select (select .cse10 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse9)))))) (forall ((v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_135 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (or (not (= (select (select (store .cse11 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_135) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) .cse12)) (< (select (select .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse12)))))) (or .cse13 .cse4) (forall ((v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_156 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select .cse14 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (< (select (select .cse14 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store .cse14 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_156) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (let ((.cse16 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621))) (let ((.cse15 (select (select (store .cse16 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= .cse15 |c_ULTIMATE.start_main_#t~mem9#1.base|)) (< (select (select .cse16 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= .cse15 (select (select .cse16 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))))))) (forall ((v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int)) (v_prenex_131 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621))) (or (not (= (select (select (store .cse17 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_prenex_131) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|)) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select .cse17 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|)) (< (select (select .cse17 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|)))) (or .cse3 .cse13) (or (forall ((v_ArrVal_2622 (Array Int Int)) (v_ArrVal_2619 (Array Int Int))) (< |c_ULTIMATE.start_main_#t~mem9#1.offset| (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2619) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2622) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 1))) (forall ((v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))))) (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2621 (Array Int Int)) (v_ArrVal_2620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (let ((.cse18 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2620) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2621))) (or (not (= (select (select (store .cse18 |v_ULTIMATE.start_main_#t~mem11#1.base_45| v_ArrVal_2637) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|)) (< (select (select .cse18 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_45|) (not (= (select (select .cse18 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) |c_ULTIMATE.start_main_~#datas~0#1.base|))))))) is different from false [2023-11-24 07:29:25,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1247 treesize of output 1219 [2023-11-24 07:29:25,739 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 1130 treesize of output 1128 [2023-11-24 07:29:25,755 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 1128 treesize of output 1124 [2023-11-24 07:29:41,663 WARN L293 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 649 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-24 07:29:41,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:41,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 16542 treesize of output 13970 [2023-11-24 07:29:43,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:43,120 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 4399 treesize of output 4402 [2023-11-24 07:29:43,563 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 4393 treesize of output 4385 [2023-11-24 07:29:44,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:44,245 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 4385 treesize of output 4382 [2023-11-24 07:29:44,806 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 4373 treesize of output 4365 [2023-11-24 07:29:45,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:45,589 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 4365 treesize of output 4318 [2023-11-24 07:29:46,248 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 4309 treesize of output 4269 [2023-11-24 07:29:46,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:46,928 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 4269 treesize of output 4250 [2023-11-24 07:29:47,388 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 4241 treesize of output 4239 [2023-11-24 07:29:47,834 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 4239 treesize of output 4231 [2023-11-24 07:29:48,304 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 4231 treesize of output 4229 [2023-11-24 07:29:48,899 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 4229 treesize of output 4225 [2023-11-24 07:29:49,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:49,378 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 4225 treesize of output 4206 [2023-11-24 07:29:49,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:49,892 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 4197 treesize of output 4150 [2023-11-24 07:29:50,349 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 4141 treesize of output 4109 [2023-11-24 07:29:50,775 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 4109 treesize of output 4105 [2023-11-24 07:29:51,203 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 4105 treesize of output 4103 [2023-11-24 07:29:51,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:51,814 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 4103 treesize of output 4106 [2023-11-24 07:29:52,249 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 4097 treesize of output 4089 [2023-11-24 07:29:52,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:52,981 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 4089 treesize of output 4086 [2023-11-24 07:29:53,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:53,550 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 4077 treesize of output 4058 [2023-11-24 07:29:54,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:54,094 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 4049 treesize of output 4002 [2023-11-24 07:29:54,622 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 3993 treesize of output 3961 [2023-11-24 07:29:55,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:55,272 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 3961 treesize of output 3964 [2023-11-24 07:29:55,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:55,804 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 3955 treesize of output 3952 [2023-11-24 07:29:56,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:56,327 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 3943 treesize of output 3940 [2023-11-24 07:29:56,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:56,876 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 3931 treesize of output 3934 [2023-11-24 07:29:57,398 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 3925 treesize of output 3917 [2023-11-24 07:29:57,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:57,920 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 3917 treesize of output 3920 [2023-11-24 07:29:58,395 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 3911 treesize of output 3903 [2023-11-24 07:29:58,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:29:58,953 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 3903 treesize of output 3900 [2023-11-24 07:29:59,592 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 3891 treesize of output 3883 [2023-11-24 07:30:00,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:30:00,262 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 3883 treesize of output 3880 [2023-11-24 07:30:00,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:30:00,925 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 3871 treesize of output 3874 [2023-11-24 07:30:01,420 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 3865 treesize of output 3863 [2023-11-24 07:30:01,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:30:01,986 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 3863 treesize of output 3866 [2023-11-24 07:30:02,470 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 3857 treesize of output 3849 [2023-11-24 07:30:03,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:30:03,031 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 3849 treesize of output 3846 [2023-11-24 07:30:03,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:30:03,578 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 3837 treesize of output 3838 [2023-11-24 07:30:04,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:30:04,157 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 3829 treesize of output 3822 [2023-11-24 07:30:04,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:30:04,715 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 3813 treesize of output 3810 [2023-11-24 07:30:05,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 07:30:05,321 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 3801 treesize of output 3804 [2023-11-24 07:30:05,902 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 3795 treesize of output 3787 Killed by 15