./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 20174008 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-?-2017400-m [2023-11-24 12:26:21,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 12:26:21,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-24 12:26:21,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 12:26:21,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 12:26:21,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 12:26:21,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 12:26:21,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 12:26:21,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 12:26:21,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 12:26:21,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 12:26:21,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 12:26:21,645 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 12:26:21,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 12:26:21,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 12:26:21,647 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 12:26:21,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 12:26:21,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 12:26:21,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 12:26:21,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 12:26:21,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 12:26:21,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 12:26:21,648 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-24 12:26:21,649 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 12:26:21,649 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 12:26:21,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 12:26:21,650 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 12:26:21,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 12:26:21,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 12:26:21,650 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-24 12:26:21,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 12:26:21,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 12:26:21,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 12:26:21,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 12:26:21,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 12:26:21,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 12:26:21,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 12:26:21,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 12:26:21,653 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-24 12:26:21,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 12:26:21,653 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 12:26:21,653 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 12:26:21,654 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 12:26:21,654 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 12:26:21,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 12:26:21,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 12:26:21,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 12:26:21,899 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 12:26:21,900 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 12:26:21,901 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 12:26:22,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 12:26:23,172 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 12:26:23,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.i [2023-11-24 12:26:23,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e12b2dff0/30924e8c099840f9b4bbb8390cb2e529/FLAG3ca2bcf9e [2023-11-24 12:26:23,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e12b2dff0/30924e8c099840f9b4bbb8390cb2e529 [2023-11-24 12:26:23,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 12:26:23,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 12:26:23,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 12:26:23,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 12:26:23,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 12:26:23,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:26:23" (1/1) ... [2023-11-24 12:26:23,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c0c72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:23, skipping insertion in model container [2023-11-24 12:26:23,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:26:23" (1/1) ... [2023-11-24 12:26:23,249 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 12:26:23,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 12:26:23,588 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 12:26:23,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 12:26:23,652 INFO L206 MainTranslator]: Completed translation [2023-11-24 12:26:23,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:23 WrapperNode [2023-11-24 12:26:23,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 12:26:23,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 12:26:23,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 12:26:23,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 12:26:23,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:23" (1/1) ... [2023-11-24 12:26:23,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:23" (1/1) ... [2023-11-24 12:26:23,699 INFO L138 Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-24 12:26:23,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 12:26:23,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 12:26:23,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 12:26:23,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 12:26:23,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:23" (1/1) ... [2023-11-24 12:26:23,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:23" (1/1) ... [2023-11-24 12:26:23,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:23" (1/1) ... [2023-11-24 12:26:23,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:23" (1/1) ... [2023-11-24 12:26:23,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:23" (1/1) ... [2023-11-24 12:26:23,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:23" (1/1) ... [2023-11-24 12:26:23,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:23" (1/1) ... [2023-11-24 12:26:23,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:23" (1/1) ... [2023-11-24 12:26:23,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 12:26:23,735 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 12:26:23,735 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 12:26:23,735 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 12:26:23,736 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:23" (1/1) ... [2023-11-24 12:26:23,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 12:26:23,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:26:23,786 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 12:26:23,822 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 12:26:23,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 12:26:23,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 12:26:23,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 12:26:23,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-24 12:26:23,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 12:26:23,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 12:26:23,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 12:26:23,854 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-24 12:26:23,854 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-24 12:26:23,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 12:26:23,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 12:26:23,856 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 12:26:23,983 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 12:26:23,985 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 12:26:24,209 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 12:26:24,216 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 12:26:24,217 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 12:26:24,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:26:24 BoogieIcfgContainer [2023-11-24 12:26:24,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 12:26:24,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 12:26:24,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 12:26:24,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 12:26:24,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:26:23" (1/3) ... [2023-11-24 12:26:24,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4048dfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:26:24, skipping insertion in model container [2023-11-24 12:26:24,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:23" (2/3) ... [2023-11-24 12:26:24,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4048dfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:26:24, skipping insertion in model container [2023-11-24 12:26:24,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:26:24" (3/3) ... [2023-11-24 12:26:24,224 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i [2023-11-24 12:26:24,229 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 12:26:24,236 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 12:26:24,236 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 12:26:24,236 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 12:26:24,274 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-24 12:26:24,303 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 12:26:24,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 12:26:24,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:26:24,325 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 12:26:24,327 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 12:26:24,355 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 12:26:24,363 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-24 12:26:24,368 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;@151c832, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 12:26:24,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 12:26:24,550 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:26:24,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:26:24,554 INFO L85 PathProgramCache]: Analyzing trace with hash -118187754, now seen corresponding path program 1 times [2023-11-24 12:26:24,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:26:24,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459792055] [2023-11-24 12:26:24,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:26:24,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:26:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:26:24,874 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 12:26:24,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:26:24,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459792055] [2023-11-24 12:26:24,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459792055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 12:26:24,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 12:26:24,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 12:26:24,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22703601] [2023-11-24 12:26:24,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 12:26:24,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 12:26:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:26:24,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 12:26:24,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 12:26:24,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:24,930 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:26:24,932 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 12:26:24,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:24,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:24,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 12:26:24,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:26:24,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:26:24,957 INFO L85 PathProgramCache]: Analyzing trace with hash 108159104, now seen corresponding path program 1 times [2023-11-24 12:26:24,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:26:24,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277556839] [2023-11-24 12:26:24,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:26:24,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:26:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:26:25,574 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 12:26:25,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:26:25,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277556839] [2023-11-24 12:26:25,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277556839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 12:26:25,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 12:26:25,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 12:26:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464220591] [2023-11-24 12:26:25,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 12:26:25,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 12:26:25,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:26:25,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 12:26:25,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 12:26:25,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:25,582 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:26:25,582 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 12:26:25,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:25,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:26:25,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 12:26:25,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:26:25,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:26:25,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1728096500, now seen corresponding path program 1 times [2023-11-24 12:26:25,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:26:25,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289633729] [2023-11-24 12:26:25,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:26:25,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:26:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:26:26,188 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 12:26:26,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:26:26,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289633729] [2023-11-24 12:26:26,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289633729] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:26:26,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094257153] [2023-11-24 12:26:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:26:26,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:26:26,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:26:26,252 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 12:26:26,276 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 12:26:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:26:26,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-24 12:26:26,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:26:26,435 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 12:26:26,516 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 12:26:26,539 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 12:26:26,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:26:26,575 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 12:26:26,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:26:26,615 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 12:26:26,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:26,744 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 12:26:26,751 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 12:26:26,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:26:28,934 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 12:26:33,137 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 12:26:33,177 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 12:26:33,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094257153] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:26:33,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:26:33,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2023-11-24 12:26:33,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984771223] [2023-11-24 12:26:33,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:26:33,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-24 12:26:33,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:26:33,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-24 12:26:33,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=913, Unknown=21, NotChecked=62, Total=1122 [2023-11-24 12:26:33,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:33,181 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:26:33,182 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 12:26:33,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:33,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:26:33,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:33,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:33,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:26:33,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:26:33,883 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 12:26:34,078 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 12:26:34,078 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:26:34,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:26:34,079 INFO L85 PathProgramCache]: Analyzing trace with hash 490517125, now seen corresponding path program 2 times [2023-11-24 12:26:34,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:26:34,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340526005] [2023-11-24 12:26:34,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:26:34,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:26:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:26:34,726 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 12:26:34,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:26:34,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340526005] [2023-11-24 12:26:34,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340526005] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:26:34,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119316421] [2023-11-24 12:26:34,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 12:26:34,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:26:34,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:26:34,729 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 12:26:34,752 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 12:26:34,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 12:26:34,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 12:26:34,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-24 12:26:34,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:26:34,895 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 12:26:35,026 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 12:26:35,056 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 12:26:35,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:26:35,093 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 12:26:35,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:26:35,136 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 12:26:35,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:35,290 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 12:26:35,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:35,305 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 12:26:35,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:35,319 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 12:26:35,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:35,335 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 12:26:35,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:35,415 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 12:26:35,421 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 12:26:35,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:26:35,435 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 12:26:35,471 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 12:26:35,567 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 12:26:35,579 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 12:26:35,777 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 12:26:35,843 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 12:26:35,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119316421] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:26:35,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:26:35,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2023-11-24 12:26:35,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692639308] [2023-11-24 12:26:35,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:26:35,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-24 12:26:35,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:26:35,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-24 12:26:35,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1062, Unknown=4, NotChecked=276, Total=1482 [2023-11-24 12:26:35,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:35,855 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:26:35,856 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 12:26:35,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:35,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:26:35,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:26:35,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:37,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:37,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:26:37,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:26:37,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:26:37,064 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 12:26:37,248 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 12:26:37,249 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:26:37,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:26:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1939312127, now seen corresponding path program 1 times [2023-11-24 12:26:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:26:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926937591] [2023-11-24 12:26:37,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:26:37,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:26:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:26:38,076 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 12:26:38,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:26:38,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926937591] [2023-11-24 12:26:38,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926937591] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:26:38,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720138727] [2023-11-24 12:26:38,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:26:38,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:26:38,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:26:38,089 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 12:26:38,114 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 12:26:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:26:38,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-24 12:26:38,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:26:38,207 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 12:26:38,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:38,264 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 12:26:38,305 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 12:26:38,306 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 12:26:38,692 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-24 12:26:38,693 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 12:26:38,904 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:26:38,904 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 12:26:38,936 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 12:26:38,987 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 12:26:39,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:26:39,051 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 12:26:39,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:26:39,123 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 12:26:39,484 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-24 12:26:39,485 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 12:26:39,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:39,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 12:26:39,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:39,567 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 12:26:39,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:39,583 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 12:26:39,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:39,600 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 12:26:39,626 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 12:26:39,633 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 12:26:39,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:26:39,648 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 12:26:39,808 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 12:26:39,912 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 12:26:39,924 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 12:26:40,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:26:40,475 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 12:26:40,480 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 12:26:40,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:26:40,639 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 12:26:40,715 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 12:26:40,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720138727] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:26:40,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:26:40,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 49 [2023-11-24 12:26:40,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039960000] [2023-11-24 12:26:40,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:26:40,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-24 12:26:40,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:26:40,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-24 12:26:40,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1850, Unknown=42, NotChecked=364, Total=2450 [2023-11-24 12:26:40,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:40,719 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:26:40,719 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 12:26:40,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:40,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:26:40,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:26:40,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:26:40,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:44,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:26:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:26:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:26:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-24 12:26:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-24 12:26:44,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 12:26:44,462 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 12:26:44,462 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:26:44,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:26:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1804082767, now seen corresponding path program 2 times [2023-11-24 12:26:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:26:44,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040207806] [2023-11-24 12:26:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:26:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:26:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:26:45,306 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 12:26:45,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:26:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040207806] [2023-11-24 12:26:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040207806] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:26:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491308735] [2023-11-24 12:26:45,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 12:26:45,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:26:45,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:26:45,320 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 12:26:45,361 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 12:26:45,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 12:26:45,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 12:26:45,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-24 12:26:45,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:26:45,480 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 12:26:45,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:45,571 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 12:26:45,633 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 12:26:45,633 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 12:26:46,323 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-24 12:26:46,326 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 12:26:46,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:46,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:46,335 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 12:26:46,335 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 12:26:46,674 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:26:46,675 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 12:26:46,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:46,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:46,688 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 12:26:46,688 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 12:26:46,748 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 12:26:46,833 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 12:26:46,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:26:46,921 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 12:26:47,422 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-24 12:26:47,422 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 12:26:47,435 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-24 12:26:47,435 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 12:26:47,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:47,492 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 12:26:47,510 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 12:26:47,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:47,559 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 12:26:47,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:47,586 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 12:26:47,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:26:47,612 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 12:26:47,698 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 12:26:47,741 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 12:26:47,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:26:48,318 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 12:26:48,339 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 12:26:48,383 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 12:26:50,467 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 12:26:52,896 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 12:26:54,950 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 12:26:54,999 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-24 12:26:54,999 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 12:26:55,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:26:55,024 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 12:26:55,033 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 12:26:55,215 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:26:55,231 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-24 12:26:55,232 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 12:26:55,240 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 12:26:55,243 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:26:55,245 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 12:26:55,265 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:26:55,272 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-24 12:26:55,272 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 12:26:55,275 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:26:55,281 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-24 12:26:55,282 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 12:26:56,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:26:56,201 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 12:26:56,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:26:56,233 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 12:26:56,244 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 12:26:56,250 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 12:27:00,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:00,327 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 12:27:00,507 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 12:27:00,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491308735] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:27:00,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:27:00,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 23] total 60 [2023-11-24 12:27:00,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813368871] [2023-11-24 12:27:00,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:27:00,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-24 12:27:00,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:27:00,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-24 12:27:00,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2724, Unknown=24, NotChecked=666, Total=3660 [2023-11-24 12:27:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:00,512 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:27:00,512 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 12:27:00,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:00,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:00,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:27:00,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-24 12:27:00,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-24 12:27:00,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:06,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:27:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-24 12:27:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-24 12:27:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-24 12:27:06,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-24 12:27:06,318 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 12:27:06,319 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:27:06,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:27:06,319 INFO L85 PathProgramCache]: Analyzing trace with hash -2115809315, now seen corresponding path program 3 times [2023-11-24 12:27:06,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:27:06,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262477998] [2023-11-24 12:27:06,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:06,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:27:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:07,092 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 12:27:07,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:27:07,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262477998] [2023-11-24 12:27:07,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262477998] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:27:07,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401787471] [2023-11-24 12:27:07,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 12:27:07,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:27:07,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:27:07,093 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 12:27:07,094 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 12:27:07,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-24 12:27:07,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 12:27:07,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-24 12:27:07,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:27:07,242 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 12:27:07,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:07,303 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 12:27:07,339 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 12:27:07,340 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 12:27:07,705 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:27:07,705 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 12:27:07,936 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:27:07,937 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 12:27:07,964 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 12:27:08,028 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 12:27:08,303 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-24 12:27:08,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 40 [2023-11-24 12:27:08,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:08,351 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 12:27:08,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:08,365 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 12:27:08,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:08,414 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 12:27:08,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:08,471 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 12:27:08,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:08,493 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 12:27:08,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:08,507 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 12:27:08,534 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 12:27:08,540 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 12:27:08,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:27:08,557 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_683 (Array Int Int))) (= (select (select (store |c_#race| |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))) (= (select (select (store |c_#race| |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))) (= (select (select (store |c_#race| |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))) (= (select (select (store |c_#race| |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|))) is different from false [2023-11-24 12:27:08,582 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 12:27:08,613 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 12:27:08,626 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 12:27:08,757 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 12:27:08,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:08,983 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 12:27:08,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:08,988 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 12:27:08,991 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 12:27:08,994 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 12:27:09,004 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:27:09,005 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:27:09,008 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-24 12:27:09,009 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 12:27:09,010 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:27:09,011 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:27:09,012 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:27:09,013 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:27:09,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:09,573 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 12:27:09,579 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 12:27:09,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:09,755 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 12:27:09,839 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 12:27:09,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401787471] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:27:09,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:27:09,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 50 [2023-11-24 12:27:09,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206964460] [2023-11-24 12:27:09,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:27:09,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-24 12:27:09,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:27:09,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-24 12:27:09,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1877, Unknown=25, NotChecked=460, Total=2550 [2023-11-24 12:27:09,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:09,846 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:27:09,846 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 12:27:09,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:09,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:09,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:27:09,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-24 12:27:09,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-24 12:27:09,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-11-24 12:27:09,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:13,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:13,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:13,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:27:13,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-24 12:27:13,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-24 12:27:13,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-24 12:27:13,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-24 12:27:13,995 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 12:27:14,194 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 12:27:14,194 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:27:14,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:27:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1748119725, now seen corresponding path program 4 times [2023-11-24 12:27:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:27:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080707259] [2023-11-24 12:27:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:27:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:14,910 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 12:27:14,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:27:14,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080707259] [2023-11-24 12:27:14,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080707259] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:27:14,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259430048] [2023-11-24 12:27:14,910 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-24 12:27:14,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:27:14,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:27:14,920 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 12:27:14,970 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 12:27:15,203 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-24 12:27:15,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 12:27:15,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-24 12:27:15,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:27:15,233 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 12:27:15,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:15,302 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 12:27:15,349 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 12:27:15,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 15 treesize of output 15 [2023-11-24 12:27:15,491 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 12:27:15,796 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-24 12:27:15,796 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 12:27:16,002 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:27:16,003 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 12:27:16,057 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 12:27:16,263 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 12:27:16,264 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 12:27:16,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:16,298 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 12:27:16,310 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 12:27:16,347 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 12:27:16,405 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 12:27:16,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:16,452 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 12:27:16,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:16,465 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 12:27:16,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:16,481 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 12:27:16,526 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 12:27:16,560 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 12:27:16,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:27:16,575 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 12:27:16,622 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 12:27:16,739 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 12:27:17,064 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 12:27:17,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:17,288 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 12:27:17,291 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 12:27:17,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:17,575 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 12:27:17,740 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 12:27:17,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259430048] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:27:17,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:27:17,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 51 [2023-11-24 12:27:17,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992596645] [2023-11-24 12:27:17,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:27:17,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-24 12:27:17,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:27:17,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-24 12:27:17,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2121, Unknown=39, NotChecked=288, Total=2652 [2023-11-24 12:27:17,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:17,744 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:27:17,744 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 12:27:17,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:17,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:17,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:27:17,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-11-24 12:27:17,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-24 12:27:17,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-24 12:27:17,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-11-24 12:27:17,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:27:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-24 12:27:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-24 12:27:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-24 12:27:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-24 12:27:22,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-24 12:27:22,191 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 12:27:22,391 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 12:27:22,392 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:27:22,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:27:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1504699717, now seen corresponding path program 5 times [2023-11-24 12:27:22,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:27:22,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003970910] [2023-11-24 12:27:22,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:22,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:27:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:23,172 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 12:27:23,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:27:23,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003970910] [2023-11-24 12:27:23,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003970910] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:27:23,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57251329] [2023-11-24 12:27:23,173 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-24 12:27:23,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:27:23,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:27:23,174 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 12:27:23,210 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 12:27:23,313 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 12:27:23,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 12:27:23,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-24 12:27:23,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:27:23,323 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 12:27:23,355 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 12:27:23,355 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 12:27:23,439 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-11-24 12:27:23,439 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 12:27:23,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:23,489 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 12:27:23,490 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 12:27:23,803 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-24 12:27:23,803 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 12:27:23,823 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 12:27:24,096 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-24 12:27:24,097 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 12:27:24,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:24,294 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 12:27:24,330 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 12:27:24,365 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 12:27:24,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:24,413 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 12:27:24,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:24,464 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 12:27:24,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:24,521 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 12:27:24,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:24,535 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 12:27:24,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:24,559 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 12:27:24,586 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 12:27:24,592 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 12:27:24,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:27:24,610 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 12:27:24,633 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 12:27:24,678 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_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 2)) |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) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |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) 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|))))) is different from false [2023-11-24 12:27:24,691 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 12:27:25,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:25,222 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 12:27:25,228 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 12:27:25,466 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 12:27:25,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57251329] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:27:25,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:27:25,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 49 [2023-11-24 12:27:25,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168117669] [2023-11-24 12:27:25,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:27:25,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-24 12:27:25,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:27:25,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-24 12:27:25,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1883, Unknown=11, NotChecked=364, Total=2450 [2023-11-24 12:27:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:25,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:27:25,469 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 12:27:25,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:25,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:25,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:27:25,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-11-24 12:27:25,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-11-24 12:27:25,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-11-24 12:27:25,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-11-24 12:27:25,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-24 12:27:25,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-24 12:27:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-24 12:27:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-11-24 12:27:42,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-11-24 12:27:42,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-24 12:27:42,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-24 12:27:42,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-24 12:27:42,048 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-11-24 12:27:42,069 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 12:27:42,274 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 12:27:42,282 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1] [2023-11-24 12:27:42,284 INFO L307 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2023-11-24 12:27:42,287 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 12:27:42,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 12:27:42,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:27:42,292 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 12:27:42,293 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 12:27:42,314 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 12:27:42,314 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 12:27:42,314 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;@151c832, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 12:27:42,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-24 12:27:42,326 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 12:27:42,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:27:42,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1375234035, now seen corresponding path program 1 times [2023-11-24 12:27:42,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:27:42,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261347902] [2023-11-24 12:27:42,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:42,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:27:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:42,339 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 12:27:42,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:27:42,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261347902] [2023-11-24 12:27:42,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261347902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 12:27:42,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 12:27:42,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 12:27:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780515526] [2023-11-24 12:27:42,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 12:27:42,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 12:27:42,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:27:42,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 12:27:42,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 12:27:42,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,343 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:27:42,343 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 12:27:42,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 12:27:42,344 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 12:27:42,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:27:42,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1948619337, now seen corresponding path program 1 times [2023-11-24 12:27:42,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:27:42,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146075143] [2023-11-24 12:27:42,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:27:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:42,432 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 12:27:42,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:27:42,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146075143] [2023-11-24 12:27:42,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146075143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 12:27:42,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 12:27:42,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 12:27:42,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204657699] [2023-11-24 12:27:42,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 12:27:42,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 12:27:42,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:27:42,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 12:27:42,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 12:27:42,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,434 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:27:42,435 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 12:27:42,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:42,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 12:27:42,461 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 12:27:42,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:27:42,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1614691510, now seen corresponding path program 1 times [2023-11-24 12:27:42,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:27:42,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653957664] [2023-11-24 12:27:42,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:42,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:27:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:42,569 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 12:27:42,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:27:42,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653957664] [2023-11-24 12:27:42,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653957664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 12:27:42,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 12:27:42,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 12:27:42,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58031424] [2023-11-24 12:27:42,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 12:27:42,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 12:27:42,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:27:42,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 12:27:42,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 12:27:42,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,571 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:27:42,571 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 12:27:42,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:42,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:42,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:42,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 12:27:42,689 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 12:27:42,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:27:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2097273391, now seen corresponding path program 1 times [2023-11-24 12:27:42,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:27:42,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498119853] [2023-11-24 12:27:42,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:42,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:27:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 12:27:42,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 12:27:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 12:27:42,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 12:27:42,753 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 12:27:42,753 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-24 12:27:42,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-24 12:27:42,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-24 12:27:42,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-24 12:27:42,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-24 12:27:42,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-24 12:27:42,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-24 12:27:42,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 12:27:42,759 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-24 12:27:42,760 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-11-24 12:27:42,761 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 12:27:42,761 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-24 12:27:42,778 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-24 12:27:42,786 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 12:27:42,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 12:27:42,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:27:42,809 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 12:27:42,844 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 12:27:42,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2023-11-24 12:27:42,845 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 12:27:42,845 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;@151c832, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 12:27:42,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 12:27:42,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:27:42,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:27:42,956 INFO L85 PathProgramCache]: Analyzing trace with hash -968901882, now seen corresponding path program 1 times [2023-11-24 12:27:42,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:27:42,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398547243] [2023-11-24 12:27:42,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:42,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:27:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:42,971 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 12:27:42,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:27:42,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398547243] [2023-11-24 12:27:42,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398547243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 12:27:42,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 12:27:42,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 12:27:42,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752953759] [2023-11-24 12:27:42,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 12:27:42,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 12:27:42,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:27:42,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 12:27:42,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 12:27:42,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,973 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:27:42,974 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 12:27:42,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:42,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 12:27:42,978 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:27:42,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:27:42,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1206880, now seen corresponding path program 1 times [2023-11-24 12:27:42,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:27:42,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101478158] [2023-11-24 12:27:42,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:42,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:27:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:43,127 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 12:27:43,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:27:43,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101478158] [2023-11-24 12:27:43,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101478158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 12:27:43,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 12:27:43,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 12:27:43,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101162196] [2023-11-24 12:27:43,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 12:27:43,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 12:27:43,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:27:43,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 12:27:43,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 12:27:43,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:43,131 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:27:43,131 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 12:27:43,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:43,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:43,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:43,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:43,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 12:27:43,379 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:27:43,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:27:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash 484097772, now seen corresponding path program 1 times [2023-11-24 12:27:43,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:27:43,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059041513] [2023-11-24 12:27:43,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:43,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:27:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:43,684 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 12:27:43,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:27:43,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059041513] [2023-11-24 12:27:43,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059041513] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:27:43,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86686906] [2023-11-24 12:27:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:43,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:27:43,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:27:43,689 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 12:27:43,727 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 12:27:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:43,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-24 12:27:43,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:27:43,875 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 12:27:43,949 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 12:27:43,970 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 12:27:43,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:43,995 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 12:27:44,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:44,027 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 12:27:44,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:44,130 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 12:27:44,135 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 12:27:44,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:27:44,149 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 12:27:44,207 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 12:27:44,217 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 12:27:46,340 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 12:27:46,369 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 12:27:46,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86686906] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:27:46,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:27:46,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2023-11-24 12:27:46,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289300254] [2023-11-24 12:27:46,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:27:46,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-24 12:27:46,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:27:46,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-24 12:27:46,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=821, Unknown=3, NotChecked=180, Total=1122 [2023-11-24 12:27:46,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:46,371 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:27:46,372 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 12:27:46,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:46,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:46,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:50,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:50,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:50,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:27:50,350 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 12:27:50,539 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 12:27:50,539 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:27:50,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:27:50,540 INFO L85 PathProgramCache]: Analyzing trace with hash 127283813, now seen corresponding path program 2 times [2023-11-24 12:27:50,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:27:50,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333704358] [2023-11-24 12:27:50,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:50,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:27:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:51,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 12:27:51,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:27:51,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333704358] [2023-11-24 12:27:51,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333704358] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:27:51,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408881362] [2023-11-24 12:27:51,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 12:27:51,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:27:51,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:27:51,051 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 12:27:51,077 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 12:27:51,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 12:27:51,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 12:27:51,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-24 12:27:51,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:27:51,256 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 12:27:51,374 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 12:27:51,402 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 12:27:51,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:51,436 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 12:27:51,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:51,478 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 12:27:51,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:51,609 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 12:27:51,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:51,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 12:27:51,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:51,662 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 12:27:51,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:51,676 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 12:27:51,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:51,746 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 12:27:51,752 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 12:27:51,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:27:51,765 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 12:27:52,076 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 12:27:52,090 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 12:27:52,298 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 12:27:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-24 12:27:52,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408881362] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:27:52,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:27:52,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2023-11-24 12:27:52,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383200000] [2023-11-24 12:27:52,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:27:52,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-24 12:27:52,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:27:52,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-24 12:27:52,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1109, Unknown=21, NotChecked=210, Total=1482 [2023-11-24 12:27:52,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:52,364 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:27:52,364 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 12:27:52,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:52,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:52,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:27:52,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:53,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:53,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:53,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:27:53,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:27:53,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-24 12:27:53,665 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 12:27:53,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:27:53,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:27:53,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1664817300, now seen corresponding path program 1 times [2023-11-24 12:27:53,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:27:53,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508045897] [2023-11-24 12:27:53,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:53,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:27:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:53,862 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 12:27:53,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:27:53,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508045897] [2023-11-24 12:27:53,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508045897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 12:27:53,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 12:27:53,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 12:27:53,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473153139] [2023-11-24 12:27:53,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 12:27:53,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 12:27:53,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:27:53,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 12:27:53,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 12:27:53,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:53,865 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:27:53,865 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 12:27:53,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:53,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:53,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:27:53,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:27:53,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:27:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:27:53,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:53,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 12:27:53,986 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:27:53,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:27:53,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1264413843, now seen corresponding path program 1 times [2023-11-24 12:27:53,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:27:53,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299760767] [2023-11-24 12:27:53,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:53,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:27:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:54,197 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 12:27:54,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:27:54,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299760767] [2023-11-24 12:27:54,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299760767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 12:27:54,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 12:27:54,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 12:27:54,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669603017] [2023-11-24 12:27:54,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 12:27:54,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 12:27:54,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:27:54,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 12:27:54,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 12:27:54,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:54,199 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:27:54,199 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 12:27:54,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:54,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:54,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:27:54,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:27:54,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:54,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:54,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:27:54,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:54,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:27:54,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:27:54,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:27:54,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-24 12:27:54,439 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:27:54,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:27:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1206707519, now seen corresponding path program 1 times [2023-11-24 12:27:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:27:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592461978] [2023-11-24 12:27:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:27:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:56,304 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 12:27:56,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:27:56,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592461978] [2023-11-24 12:27:56,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592461978] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:27:56,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287167302] [2023-11-24 12:27:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:27:56,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:27:56,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:27:56,306 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 12:27:56,306 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 12:27:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:27:56,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-24 12:27:56,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:27:56,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:56,910 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 12:27:56,927 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:27:56,928 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 12:27:57,163 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:27:57,163 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 12:27:57,167 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 12:27:57,178 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:27:57,178 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 12:27:57,231 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 12:27:57,283 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 12:27:57,367 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 12:27:57,475 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 12:27:58,092 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:27:58,092 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 12:27:58,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:58,097 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 12:27:58,195 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:27:58,195 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 12:27:58,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:58,200 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 12:27:58,293 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:27:58,294 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 12:27:58,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:58,301 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 12:27:58,393 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:27:58,394 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 12:27:58,403 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 12:27:58,723 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:27:58,723 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 12:27:58,734 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 12:27:58,862 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:27:58,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 12:27:58,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:58,868 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 12:27:59,009 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:27:59,010 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 12:27:59,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:59,017 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 12:27:59,140 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:27:59,140 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 12:27:59,151 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 12:27:59,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:59,287 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 12:27:59,293 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 12:27:59,315 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:27:59,315 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 12:27:59,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:27:59,328 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 12:27:59,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:59,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 12:27:59,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:59,666 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 12:27:59,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:59,684 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 12:27:59,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:59,707 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 12:27:59,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:59,838 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 12:27:59,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:59,856 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 12:27:59,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:59,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 12:27:59,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:27:59,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 12:28:00,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:00,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:00,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:00,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:00,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:00,110 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 12:28:00,117 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 12:28:00,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:28:01,261 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 12:28:01,435 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 12:28:01,765 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 12:28:02,122 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 12:28:02,206 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 12:28:02,274 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 12:28:02,455 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 12:28:02,495 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 12:28:02,545 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 12:28:02,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:02,569 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 12:28:02,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:02,581 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 12:28:02,611 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 12:28:02,629 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 12:28:03,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:03,126 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 12:28:03,146 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 12:28:03,156 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 12:28:03,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:03,170 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 12:28:03,175 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:03,175 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:03,184 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-24 12:28:03,185 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 12:28:03,194 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 12:28:03,201 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 12:28:03,208 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 12:28:03,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:03,249 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 12:28:03,254 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:03,255 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:03,264 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-24 12:28:03,265 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 12:28:03,312 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 12:28:03,320 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 12:28:03,329 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 12:28:03,920 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 12:28:03,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 10 treesize of output 8 [2023-11-24 12:28:06,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:06,314 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 12:28:06,421 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 12:28:06,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287167302] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:28:06,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:28:06,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 73 [2023-11-24 12:28:06,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177730205] [2023-11-24 12:28:06,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:28:06,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-24 12:28:06,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:28:06,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-24 12:28:06,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=3899, Unknown=12, NotChecked=1206, Total=5402 [2023-11-24 12:28:06,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:28:06,425 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:28:06,426 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 12:28:06,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:28:06,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:06,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:28:06,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:28:06,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:06,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:06,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:28:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:28:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:28:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:28:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-11-24 12:28:20,873 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 12:28:21,043 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 12:28:21,043 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:28:21,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:28:21,043 INFO L85 PathProgramCache]: Analyzing trace with hash 720158051, now seen corresponding path program 1 times [2023-11-24 12:28:21,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:28:21,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554549929] [2023-11-24 12:28:21,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:28:21,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:28:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:28:22,240 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 12:28:22,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:28:22,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554549929] [2023-11-24 12:28:22,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554549929] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:28:22,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681608469] [2023-11-24 12:28:22,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:28:22,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:28:22,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:28:22,241 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 12:28:22,242 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 12:28:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:28:22,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-24 12:28:22,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:28:22,448 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 12:28:22,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:22,511 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 12:28:22,544 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 12:28:22,544 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 12:28:22,872 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:28:22,873 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 12:28:23,063 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:28:23,064 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 12:28:23,106 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 12:28:23,187 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 12:28:23,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:23,285 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 12:28:23,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:23,369 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 12:28:23,643 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:28:23,644 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 12:28:23,651 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 12:28:23,703 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:28:23,704 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 12:28:23,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:23,708 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 12:28:23,773 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:28:23,773 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 12:28:23,781 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 12:28:23,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:23,840 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 12:28:24,056 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:28:24,057 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 12:28:24,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:24,081 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 12:28:24,147 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:28:24,147 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 12:28:24,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:24,153 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 12:28:24,234 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:28:24,235 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 12:28:24,245 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 12:28:24,312 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:28:24,312 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 12:28:24,322 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 12:28:24,416 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-24 12:28:24,417 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 12:28:24,733 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-24 12:28:24,733 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 12:28:24,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:24,792 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 12:28:24,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:24,816 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 12:28:24,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:24,828 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 12:28:24,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:24,840 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 12:28:24,858 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 12:28:24,863 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 12:28:24,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:28:24,959 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((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) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (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) |c_ULTIMATE.start_main_#t~mem14#1.base| 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))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1914) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (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) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1915) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false [2023-11-24 12:28:24,984 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 12:28:25,059 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 12:28:25,100 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 12:28:25,160 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 12:28:25,260 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 12:28:25,272 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 12:28:25,286 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 12:28:25,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:25,296 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 12:28:25,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:25,301 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 12:28:25,321 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 12:28:25,324 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 12:28:25,327 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 12:28:25,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:25,352 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 12:28:25,353 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:25,353 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:25,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:25,356 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 12:28:25,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:25,364 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 12:28:25,365 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:25,366 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:25,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:25,368 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 12:28:25,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:25,391 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 12:28:25,392 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:25,393 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:25,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:25,397 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 12:28:26,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:26,299 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 12:28:26,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 288 treesize of output 278 [2023-11-24 12:28:26,324 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 12:28:26,331 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 12:28:26,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:26,536 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 12:28:26,619 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 12:28:26,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681608469] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:28:26,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:28:26,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 24] total 62 [2023-11-24 12:28:26,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582542633] [2023-11-24 12:28:26,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:28:26,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-11-24 12:28:26,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:28:26,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-11-24 12:28:26,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2672, Unknown=75, NotChecked=904, Total=3906 [2023-11-24 12:28:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:28:26,623 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:28:26,623 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 12:28:26,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:28:26,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:26,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:28:26,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:28:26,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:26,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:26,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-11-24 12:28:26,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:28:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:28:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:28:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:28:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-11-24 12:28:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-24 12:28:31,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-24 12:28:31,332 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 12:28:31,333 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:28:31,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:28:31,333 INFO L85 PathProgramCache]: Analyzing trace with hash -500996372, now seen corresponding path program 1 times [2023-11-24 12:28:31,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:28:31,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221728144] [2023-11-24 12:28:31,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:28:31,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:28:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:28:31,579 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 12:28:31,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:28:31,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221728144] [2023-11-24 12:28:31,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221728144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 12:28:31,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 12:28:31,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 12:28:31,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581223967] [2023-11-24 12:28:31,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 12:28:31,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 12:28:31,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:28:31,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 12:28:31,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 12:28:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:28:31,581 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:28:31,581 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 12:28:31,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:28:31,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:31,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:28:31,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:28:31,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:31,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:31,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-11-24 12:28:31,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-24 12:28:31,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:28:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:28:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:28:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:28:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-11-24 12:28:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-24 12:28:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:28:31,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-24 12:28:31,742 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:28:31,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:28:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1986516461, now seen corresponding path program 1 times [2023-11-24 12:28:31,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:28:31,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243695384] [2023-11-24 12:28:31,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:28:31,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:28:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:28:33,699 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 12:28:33,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:28:33,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243695384] [2023-11-24 12:28:33,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243695384] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:28:33,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001264825] [2023-11-24 12:28:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:28:33,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:28:33,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:28:33,701 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 12:28:33,703 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 12:28:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:28:33,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-24 12:28:33,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:28:33,934 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 12:28:34,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:34,019 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 12:28:34,075 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 12:28:34,075 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 12:28:34,448 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-24 12:28:34,448 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 12:28:34,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:34,453 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 12:28:34,669 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:28:34,669 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 12:28:34,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:34,680 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 12:28:34,702 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 12:28:34,770 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 12:28:34,840 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 12:28:34,925 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 12:28:35,298 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 12:28:35,415 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:28:35,415 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 12:28:35,424 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 12:28:35,509 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:28:35,509 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 12:28:35,512 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 12:28:35,605 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:28:35,605 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 12:28:35,613 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 12:28:35,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:35,692 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 12:28:35,969 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:28:35,969 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 12:28:35,973 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 12:28:36,077 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:28:36,077 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 12:28:36,081 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 12:28:36,192 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:28:36,193 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 12:28:36,196 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 12:28:36,288 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:28:36,288 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 12:28:36,298 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 12:28:36,425 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-24 12:28:36,425 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 12:28:36,808 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-24 12:28:36,808 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 12:28:36,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:36,877 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 12:28:36,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:36,893 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 12:28:36,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:36,907 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 12:28:36,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:36,922 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 12:28:36,972 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 12:28:36,985 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 12:28:36,995 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 12:28:37,007 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 12:28:37,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:37,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:37,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:37,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:28:37,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:37,121 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 12:28:37,126 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 12:28:37,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:28:40,941 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 12:28:41,060 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 12:28:41,903 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 12:28:41,931 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 12:28:42,061 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 12:28:42,155 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 12:28:42,330 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 12:28:42,412 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 12:28:42,449 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 12:28:42,635 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 12:28:42,721 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 12:28:42,915 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 12:28:42,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:42,933 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 12:28:42,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:42,977 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 12:28:43,161 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 12:28:43,195 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 12:28:43,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 3984 treesize of output 3728 [2023-11-24 12:28:46,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:46,597 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 12:28:46,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:46,641 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 12:28:46,646 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:46,646 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:46,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:46,658 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 12:28:46,685 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 12:28:46,699 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 12:28:46,714 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 12:28:47,234 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 12:28:47,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:47,306 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 12:28:47,311 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:47,311 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:47,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:47,324 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 12:28:47,346 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 12:28:47,358 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 12:28:47,372 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 12:28:48,025 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 12:28:48,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:48,062 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 12:28:48,066 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:48,066 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:28:48,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:48,076 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 12:28:48,098 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 12:28:48,112 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 12:28:48,127 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 12:28:48,328 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 12:28:50,560 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 12:28:55,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:55,491 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 12:28:57,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:57,178 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 12:28:57,416 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 12:28:57,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:57,670 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 12:28:57,898 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 12:28:58,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:58,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 9991 treesize of output 9936 [2023-11-24 12:28:58,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:58,427 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 12:28:58,660 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 12:28:58,904 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 12:28:59,137 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 12:28:59,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:59,402 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 12:28:59,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:28:59,675 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 12:28:59,914 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 12:29:00,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:29:00,190 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 12:29:00,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:29:00,494 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 12:29:00,763 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 12:29:01,045 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 12:29:01,315 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 12:29:01,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9075 treesize of output 8877 [2023-11-24 12:29:01,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:29:01,895 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 12:29:02,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:29:02,193 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 12:29:02,465 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 12:29:02,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:29:02,777 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 12:29:03,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:29:03,058 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 12:29:33,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:29:33,782 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 12:29:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2023-11-24 12:29:35,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001264825] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:29:35,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:29:35,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 31] total 83 [2023-11-24 12:29:35,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766305899] [2023-11-24 12:29:35,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:29:35,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2023-11-24 12:29:35,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:29:35,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2023-11-24 12:29:35,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=4744, Unknown=71, NotChecked=1812, Total=6972 [2023-11-24 12:29:35,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:29:35,159 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:29:35,160 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 12:29:35,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:29:35,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:29:35,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:29:35,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:29:35,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:29:35,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:29:35,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-11-24 12:29:35,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-24 12:29:35,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:29:35,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:30:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:30:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:30:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:30:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-24 12:30:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:30:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:30:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-11-24 12:30:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-24 12:30:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:30:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-11-24 12:30:02,771 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 12:30:02,960 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 12:30:02,961 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:30:02,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:30:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1081034471, now seen corresponding path program 2 times [2023-11-24 12:30:02,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:30:02,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671681418] [2023-11-24 12:30:02,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:30:02,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:30:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:30:04,927 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 12:30:04,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:30:04,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671681418] [2023-11-24 12:30:04,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671681418] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:30:04,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537489333] [2023-11-24 12:30:04,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 12:30:04,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:30:04,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:30:04,929 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 12:30:04,931 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 12:30:05,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 12:30:05,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 12:30:05,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-24 12:30:05,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:30:05,581 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:30:05,582 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 12:30:05,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:05,590 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 12:30:05,907 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:30:05,907 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 12:30:05,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:05,916 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 12:30:05,940 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 12:30:06,011 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 12:30:06,084 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 12:30:06,448 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 12:30:06,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:30:06,455 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 12:30:06,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:06,531 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 12:30:06,557 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 12:30:06,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:06,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 12:30:06,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:06,652 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 12:30:06,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:06,668 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 12:30:06,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:06,739 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 12:30:06,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:06,758 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 12:30:06,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:06,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 43 treesize of output 32 [2023-11-24 12:30:06,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:06,802 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 12:30:07,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:07,059 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 12:30:07,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:07,072 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 12:30:07,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:07,087 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 12:30:07,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:07,105 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 12:30:07,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:07,204 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 12:30:07,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:07,215 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 12:30:07,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:07,230 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 12:30:07,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:07,242 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 12:30:07,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:07,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:07,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:07,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:07,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:30:07,365 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 12:30:07,370 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 12:30:07,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:30:08,687 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 12:30:08,801 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 12:30:09,043 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 12:30:09,347 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 12:30:09,375 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 12:30:09,411 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 12:30:09,494 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 12:30:09,538 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 12:30:09,674 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 12:30:09,709 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 12:30:09,784 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-24 12:30:09,785 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 12:30:09,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:30:09,823 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 12:30:09,839 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 12:30:09,849 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 12:30:09,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 932 treesize of output 868 [2023-11-24 12:30:10,335 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:10,335 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:10,342 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-24 12:30:10,342 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 12:30:10,346 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:10,346 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:10,353 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-24 12:30:10,353 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 12:30:10,356 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:10,357 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:10,370 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-24 12:30:10,371 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 12:30:10,378 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:10,380 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 12:30:10,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:10,387 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 12:30:11,003 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 12:30:11,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 10 treesize of output 8 [2023-11-24 12:30:13,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:30:13,385 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 12:30:13,486 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 12:30:13,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537489333] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:30:13,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:30:13,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 27] total 73 [2023-11-24 12:30:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626300665] [2023-11-24 12:30:13,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:30:13,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-24 12:30:13,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:30:13,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-24 12:30:13,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3810, Unknown=14, NotChecked=1330, Total=5402 [2023-11-24 12:30:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:30:13,496 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:30:13,496 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 12:30:13,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:30:13,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:30:13,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:30:13,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-11-24 12:30:13,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:30:13,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:30:13,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2023-11-24 12:30:13,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-24 12:30:13,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:30:13,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2023-11-24 12:30:13,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:30:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:30:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:30:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:30:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-24 12:30:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:30:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:30:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-24 12:30:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-24 12:30:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:30:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-11-24 12:30:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-11-24 12:30:27,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-24 12:30:27,504 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 12:30:27,506 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:30:27,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:30:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash 605097109, now seen corresponding path program 2 times [2023-11-24 12:30:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:30:27,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525007154] [2023-11-24 12:30:27,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:30:27,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:30:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:30:29,845 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 12:30:29,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:30:29,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525007154] [2023-11-24 12:30:29,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525007154] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:30:29,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974145329] [2023-11-24 12:30:29,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 12:30:29,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:30:29,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:30:29,846 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 12:30:29,847 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 12:30:30,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 12:30:30,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 12:30:30,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 88 conjunts are in the unsatisfiable core [2023-11-24 12:30:30,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:30:30,136 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 12:30:30,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:30,230 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 12:30:30,296 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 12:30:30,296 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 12:30:30,974 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:30:30,975 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 12:30:30,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:30,980 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 12:30:31,332 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:30:31,333 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 12:30:31,336 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 12:30:31,350 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:30:31,350 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 12:30:31,431 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 12:30:31,505 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 12:30:31,595 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 12:30:32,061 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 12:30:32,164 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:30:32,165 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 12:30:32,169 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 12:30:32,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:30:32,244 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 12:30:32,343 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:30:32,344 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 12:30:32,352 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 12:30:32,435 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:30:32,435 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 12:30:32,448 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 12:30:32,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:32,521 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 12:30:32,811 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:30:32,812 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 12:30:32,816 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 12:30:32,925 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:30:32,925 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 12:30:32,930 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 12:30:33,010 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:30:33,011 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 12:30:33,021 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 12:30:33,110 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:30:33,111 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 12:30:33,121 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 12:30:33,249 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:30:33,249 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 12:30:33,646 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-24 12:30:33,647 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 12:30:33,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:33,721 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 12:30:33,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:33,740 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 12:30:33,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:33,758 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 12:30:33,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:33,770 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 12:30:33,849 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 12:30:33,864 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 12:30:33,874 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 12:30:33,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 43 treesize of output 32 [2023-11-24 12:30:34,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:34,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:34,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:34,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:30:34,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:30:34,091 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 12:30:34,137 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 12:30:34,138 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:30:35,484 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 12:30:35,639 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 12:30:35,762 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 12:30:36,150 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 12:30:36,187 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 12:30:36,372 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 12:30:36,543 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 12:30:36,684 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 12:30:36,740 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 12:30:36,820 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 12:30:36,988 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 12:30:37,051 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 12:30:37,252 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 12:30:37,302 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 12:30:37,398 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-24 12:30:37,401 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 12:30:37,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:30:37,780 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 12:30:37,848 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 12:30:37,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2026 treesize of output 2010 [2023-11-24 12:30:37,918 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 12:30:37,958 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 12:30:42,066 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:42,187 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:42,187 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:42,215 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-24 12:30:42,216 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 12:30:42,254 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 12:30:42,263 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:42,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:30:42,274 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 12:30:42,294 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 12:30:42,307 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 12:30:43,238 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:43,283 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:43,283 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:43,315 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-24 12:30:43,316 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 12:30:43,352 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 12:30:43,365 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 12:30:43,374 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:43,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:30:43,384 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 12:30:43,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 1206 treesize of output 1174 [2023-11-24 12:30:43,727 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:43,728 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:43,757 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-24 12:30:43,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28408 treesize of output 27690 [2023-11-24 12:30:43,786 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:30:43,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:30:43,794 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 12:30:43,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 532 treesize of output 516 [2023-11-24 12:30:43,819 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 12:30:43,832 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 12:30:45,423 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 12:30:45,807 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_2621 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~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|)))) (.cse3 (not (= c_threadThread1of2ForFork0_~arg.base |c_ULTIMATE.start_main_~#tids~0#1.base|))) (.cse6 (not (= c_threadThread1of2ForFork0_~arg.base |c_ULTIMATE.start_main_~#datas~0#1.base|)))) (and (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_~arg.base v_ArrVal_2621))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (or (not (= .cse0 c_threadThread1of2ForFork0_~arg.base)) (= .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base|) (< (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 (= (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|) .cse0)))))) (or .cse2 .cse3) (forall ((v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_135 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_2621))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (or (not (= .cse4 c_threadThread1of2ForFork0_~arg.base)) (not (= (select (select (store .cse5 |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|) .cse4)) (< (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|))))) (or .cse6 .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 ((.cse7 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_2621))) (or (not (= c_threadThread1of2ForFork0_~arg.base (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|))) (< (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|) (= (select (select .cse7 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) c_threadThread1of2ForFork0_~arg.base)))) (or (forall ((v_ArrVal_2621 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_2621) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) c_threadThread1of2ForFork0_~arg.base)) .cse3) (or .cse6 (forall ((v_ArrVal_2621 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~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_2637 (Array Int Int)) (v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_2621))) (let ((.cse8 (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|))) (or (not (= c_threadThread1of2ForFork0_~arg.base .cse8)) (< (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 (= (select (select .cse9 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) .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 ((.cse10 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~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_~arg.base (select (select (store .cse10 |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|))) (= (select (select .cse10 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) c_threadThread1of2ForFork0_~arg.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_~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|) (= (select (select .cse11 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) c_threadThread1of2ForFork0_~arg.base) (not (= (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|) c_threadThread1of2ForFork0_~arg.base))))) (forall ((v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_133 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.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 (= c_threadThread1of2ForFork0_~arg.base (select (select (store .cse13 |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|))) (< (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|) (= .cse12 c_threadThread1of2ForFork0_~arg.base))))) (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_2621))) (or (not (= c_threadThread1of2ForFork0_~arg.base (select (select (store .cse14 |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 .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 .cse14 |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)) (v_prenex_131 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_2621))) (or (not (= c_threadThread1of2ForFork0_~arg.base (select (select (store .cse15 |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|))) (< (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|) (= (select (select .cse15 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) c_threadThread1of2ForFork0_~arg.base)))) (forall ((v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_137 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.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|) (< (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 (= (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|) c_threadThread1of2ForFork0_~arg.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 ((.cse17 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_2621))) (or (not (= (select (select (store .cse17 |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_~arg.base)) (< (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|) (= (select (select .cse17 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) c_threadThread1of2ForFork0_~arg.base)))) (or (forall ((v_ArrVal_2621 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_2621) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) c_threadThread1of2ForFork0_~arg.base))) (forall ((v_ArrVal_2622 (Array Int Int))) (< c_threadThread1of2ForFork0_~arg.offset (+ (select (select (store |c_#memory_$Pointer$.offset| c_threadThread1of2ForFork0_~arg.base v_ArrVal_2622) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) (* |c_ULTIMATE.start_main_~i~0#1| 4) 1)))) (forall ((v_ArrVal_2621 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_45| Int) (v_prenex_139 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_2621))) (or (not (= (select (select .cse18 |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) |c_ULTIMATE.start_main_~#tids~0#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 (= c_threadThread1of2ForFork0_~arg.base (select (select (store .cse18 |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|)))))))) is different from false [2023-11-24 12:30:47,342 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 12:30:59,353 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 12:30:59,369 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 12:30:59,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 1128 treesize of output 1124 [2023-11-24 12:31:15,379 WARN L293 SmtUtils]: Spent 6.93s 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 12:31:15,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:15,383 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 12:31:17,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:17,079 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 12:31:17,579 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 12:31:18,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:18,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 4385 treesize of output 4382 [2023-11-24 12:31:18,577 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 12:31:19,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:19,167 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 12:31:19,685 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 12:31:20,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:20,176 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 12:31:20,598 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 12:31:21,039 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 12:31:21,460 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 12:31:21,889 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 12:31:22,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:22,374 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 12:31:22,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:22,893 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 12:31:23,406 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 12:31:23,926 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 12:31:24,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 4105 treesize of output 4103 [2023-11-24 12:31:25,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:25,037 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 12:31:25,471 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 12:31:25,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:25,991 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 12:31:26,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:26,569 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 12:31:27,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:27,208 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 12:31:27,750 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 12:31:28,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:28,385 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 12:31:29,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:29,018 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 12:31:29,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:29,667 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 12:31:30,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:30,194 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 12:31:30,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 3925 treesize of output 3917 [2023-11-24 12:31:31,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:31,229 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 12:31:31,787 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 12:31:32,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:32,438 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 12:31:33,000 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 12:31:33,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:33,633 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 12:31:34,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:34,284 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 12:31:34,867 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 12:31:35,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:35,501 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 12:31:35,984 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 12:31:36,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:36,570 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 12:31:37,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:37,188 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 12:31:37,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:37,848 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 12:31:38,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:38,408 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 12:31:38,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:31:38,989 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 12:31:39,488 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 [2023-11-24 12:35:40,298 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-24 12:35:40,299 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-24 12:35:40,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-11-24 12:35:40,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-24 12:35:40,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-24 12:35:40,500 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:495) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-11-24 12:35:40,506 INFO L158 Benchmark]: Toolchain (without parser) took 557299.74ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 83.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-24 12:35:40,506 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 12:35:40,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.75ms. Allocated memory is still 155.2MB. Free memory was 83.3MB in the beginning and 108.7MB in the end (delta: -25.4MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2023-11-24 12:35:40,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.64ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 105.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 12:35:40,506 INFO L158 Benchmark]: Boogie Preprocessor took 33.70ms. Allocated memory is still 155.2MB. Free memory was 105.8MB in the beginning and 103.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 12:35:40,506 INFO L158 Benchmark]: RCFGBuilder took 483.37ms. Allocated memory is still 155.2MB. Free memory was 103.7MB in the beginning and 84.4MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-24 12:35:40,506 INFO L158 Benchmark]: TraceAbstraction took 556285.88ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 83.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-24 12:35:40,507 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.75ms. Allocated memory is still 155.2MB. Free memory was 83.3MB in the beginning and 108.7MB in the end (delta: -25.4MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.64ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 105.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.70ms. Allocated memory is still 155.2MB. Free memory was 105.8MB in the beginning and 103.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 483.37ms. Allocated memory is still 155.2MB. Free memory was 103.7MB in the beginning and 84.4MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 556285.88ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 83.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 616, independent: 607, independent conditional: 12, independent unconditional: 595, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 601, Positive cache size: 595, Positive conditional cache size: 0, Positive unconditional cache size: 595, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 616, independent: 607, independent conditional: 12, independent unconditional: 595, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 601, Positive cache size: 595, Positive conditional cache size: 0, Positive unconditional cache size: 595, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 4, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1012, independent: 993, independent conditional: 34, independent unconditional: 959, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 1445, Positive cache size: 1427, Positive conditional cache size: 0, Positive unconditional cache size: 1427, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 4, Maximal queried relation: 1, Independence queries for same thread: 8, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1172, independent: 1132, independent conditional: 60, independent unconditional: 1072, dependent: 40, dependent conditional: 21, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 1955, Positive cache size: 1917, Positive conditional cache size: 0, Positive unconditional cache size: 1917, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 18, Maximal queried relation: 2, Independence queries for same thread: 17, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1367, independent: 1289, independent conditional: 99, independent unconditional: 1190, dependent: 78, dependent conditional: 40, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 2356, Positive cache size: 2283, Positive conditional cache size: 0, Positive unconditional cache size: 2283, Negative cache size: 73, Negative conditional cache size: 0, Negative unconditional cache size: 73, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 72, Maximal queried relation: 3, Independence queries for same thread: 32, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1643, independent: 1475, independent conditional: 153, independent unconditional: 1322, dependent: 168, dependent conditional: 85, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 2992, Positive cache size: 2833, Positive conditional cache size: 0, Positive unconditional cache size: 2833, Negative cache size: 159, Negative conditional cache size: 0, Negative unconditional cache size: 159, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 260, Maximal queried relation: 4, Independence queries for same thread: 57, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1847, independent: 1565, independent conditional: 185, independent unconditional: 1380, dependent: 282, dependent conditional: 138, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 3745, Positive cache size: 3503, Positive conditional cache size: 0, Positive unconditional cache size: 3503, Negative cache size: 242, Negative conditional cache size: 0, Negative unconditional cache size: 242, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 683, Maximal queried relation: 5, Independence queries for same thread: 92, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2062, independent: 1648, independent conditional: 217, independent unconditional: 1431, dependent: 414, dependent conditional: 209, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 3863, Positive cache size: 3554, Positive conditional cache size: 0, Positive unconditional cache size: 3554, Negative cache size: 309, Negative conditional cache size: 0, Negative unconditional cache size: 309, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 1497, Maximal queried relation: 6, Independence queries for same thread: 141, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2573, independent: 1829, independent conditional: 347, independent unconditional: 1482, dependent: 744, dependent conditional: 478, dependent unconditional: 266, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 3981, Positive cache size: 3605, Positive conditional cache size: 0, Positive unconditional cache size: 3605, Negative cache size: 376, Negative conditional cache size: 0, Negative unconditional cache size: 376, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 3753, Maximal queried relation: 7, Independence queries for same thread: 254, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3593, independent: 2337, independent conditional: 663, independent unconditional: 1674, dependent: 1253, dependent conditional: 943, dependent unconditional: 310, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 4198, Positive cache size: 3774, Positive conditional cache size: 0, Positive unconditional cache size: 3774, Negative cache size: 424, Negative conditional cache size: 0, Negative unconditional cache size: 424, Unknown cache size: 4, Unknown conditional cache size: 0, Unknown unconditional cache size: 4, Eliminated conditions: 9019, Maximal queried relation: 8, Independence queries for same thread: 475, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 52, Number of trivial persistent sets: 48, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 602, independent: 595, independent conditional: 0, independent unconditional: 595, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 616, independent: 607, independent conditional: 12, independent unconditional: 595, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 601, Positive cache size: 595, Positive conditional cache size: 0, Positive unconditional cache size: 595, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 52, Number of trivial persistent sets: 48, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 602, independent: 595, independent conditional: 0, independent unconditional: 595, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 616, independent: 607, independent conditional: 12, independent unconditional: 595, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 601, Positive cache size: 595, Positive conditional cache size: 0, Positive unconditional cache size: 595, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 4, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 90, Number of trivial persistent sets: 82, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 970, independent: 959, independent conditional: 0, independent unconditional: 959, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1012, independent: 993, independent conditional: 34, independent unconditional: 959, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 1445, Positive cache size: 1427, Positive conditional cache size: 0, Positive unconditional cache size: 1427, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 4, Maximal queried relation: 1, Independence queries for same thread: 8, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 115, Number of trivial persistent sets: 91, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1091, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1172, independent: 1132, independent conditional: 60, independent unconditional: 1072, dependent: 40, dependent conditional: 21, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 1955, Positive cache size: 1917, Positive conditional cache size: 0, Positive unconditional cache size: 1917, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 18, Maximal queried relation: 2, Independence queries for same thread: 17, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 151, Number of trivial persistent sets: 111, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1228, independent: 1190, independent conditional: 0, independent unconditional: 1190, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1367, independent: 1289, independent conditional: 99, independent unconditional: 1190, dependent: 78, dependent conditional: 40, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 2356, Positive cache size: 2283, Positive conditional cache size: 0, Positive unconditional cache size: 2283, Negative cache size: 73, Negative conditional cache size: 0, Negative unconditional cache size: 73, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 72, Maximal queried relation: 3, Independence queries for same thread: 32, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 210, Number of trivial persistent sets: 160, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1405, independent: 1322, independent conditional: 0, independent unconditional: 1322, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1643, independent: 1475, independent conditional: 153, independent unconditional: 1322, dependent: 168, dependent conditional: 85, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 2992, Positive cache size: 2833, Positive conditional cache size: 0, Positive unconditional cache size: 2833, Negative cache size: 159, Negative conditional cache size: 0, Negative unconditional cache size: 159, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 260, Maximal queried relation: 4, Independence queries for same thread: 57, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 276, Number of trivial persistent sets: 224, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1524, independent: 1380, independent conditional: 0, independent unconditional: 1380, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1847, independent: 1565, independent conditional: 185, independent unconditional: 1380, dependent: 282, dependent conditional: 138, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 3745, Positive cache size: 3503, Positive conditional cache size: 0, Positive unconditional cache size: 3503, Negative cache size: 242, Negative conditional cache size: 0, Negative unconditional cache size: 242, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 683, Maximal queried relation: 5, Independence queries for same thread: 92, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 338, Number of trivial persistent sets: 285, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1636, independent: 1431, independent conditional: 0, independent unconditional: 1431, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 2062, independent: 1648, independent conditional: 217, independent unconditional: 1431, dependent: 414, dependent conditional: 209, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 3863, Positive cache size: 3554, Positive conditional cache size: 0, Positive unconditional cache size: 3554, Negative cache size: 309, Negative conditional cache size: 0, Negative unconditional cache size: 309, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 1497, Maximal queried relation: 6, Independence queries for same thread: 141, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 400, Number of trivial persistent sets: 346, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1748, independent: 1482, independent conditional: 0, independent unconditional: 1482, dependent: 266, dependent conditional: 0, dependent unconditional: 266, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 2573, independent: 1829, independent conditional: 347, independent unconditional: 1482, dependent: 744, dependent conditional: 478, dependent unconditional: 266, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 3981, Positive cache size: 3605, Positive conditional cache size: 0, Positive unconditional cache size: 3605, Negative cache size: 376, Negative conditional cache size: 0, Negative unconditional cache size: 376, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 3753, Maximal queried relation: 7, Independence queries for same thread: 254, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 2.2s, Number of persistent set computation: 505, Number of trivial persistent sets: 431, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1986, independent: 1674, independent conditional: 0, independent unconditional: 1674, dependent: 310, dependent conditional: 0, dependent unconditional: 310, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3593, independent: 2337, independent conditional: 663, independent unconditional: 1674, dependent: 1253, dependent conditional: 943, dependent unconditional: 310, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16501, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 3013, dependent conditional: 1926, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16026, independent: 13482, independent conditional: 1782, independent unconditional: 11700, dependent: 2538, dependent conditional: 1451, dependent unconditional: 1087, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 9012, dependent unconditional: 2538, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25045, independent: 13482, independent conditional: 0, independent unconditional: 13482, dependent: 11550, dependent conditional: 0, dependent unconditional: 11550, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4202, independent: 3774, independent conditional: 0, independent unconditional: 3774, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4202, independent: 3769, independent conditional: 0, independent unconditional: 3769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 433, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2779, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 2140, unknown conditional: 0, unknown unconditional: 2140] , Protected Queries: 0 ], Cache Queries: [ total: 25045, independent: 9708, independent conditional: 0, independent unconditional: 9708, dependent: 11126, dependent conditional: 0, dependent unconditional: 11126, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 4198, Positive cache size: 3774, Positive conditional cache size: 0, Positive unconditional cache size: 3774, Negative cache size: 424, Negative conditional cache size: 0, Negative unconditional cache size: 424, Unknown cache size: 4, Unknown conditional cache size: 0, Unknown unconditional cache size: 4, Eliminated conditions: 9019, Maximal queried relation: 8, Independence queries for same thread: 475, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 502, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 30, dependent conditional: 19, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 483, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 426, unknown conditional: 0, unknown unconditional: 426] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 5, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 502, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 30, dependent conditional: 19, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 483, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 426, unknown conditional: 0, unknown unconditional: 426] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 8, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 502, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 30, dependent conditional: 19, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 483, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 426, unknown conditional: 0, unknown unconditional: 426] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 12, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 490, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 18, dependent conditional: 7, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 502, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 30, dependent conditional: 19, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 483, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 426, unknown conditional: 0, unknown unconditional: 426] , Statistics on independence cache: Total cache size (in pairs): 426, Positive cache size: 415, Positive conditional cache size: 0, Positive unconditional cache size: 415, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 19, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 31, Number of trivial persistent sets: 31, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 502, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 30, dependent conditional: 19, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 483, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 426, unknown conditional: 0, unknown unconditional: 426] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 5, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 31, Number of trivial persistent sets: 31, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 502, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 30, dependent conditional: 19, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 483, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 426, unknown conditional: 0, unknown unconditional: 426] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 8, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 39, Number of trivial persistent sets: 39, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 502, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 30, dependent conditional: 19, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 483, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 426, unknown conditional: 0, unknown unconditional: 426] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 12, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 65, Number of trivial persistent sets: 65, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 455, independent: 444, independent conditional: 0, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 490, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 18, dependent conditional: 7, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 502, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 30, dependent conditional: 19, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 28, independent unconditional: 444, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 483, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 426, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 483, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 426, unknown conditional: 0, unknown unconditional: 426] , Statistics on independence cache: Total cache size (in pairs): 426, Positive cache size: 415, Positive conditional cache size: 0, Positive unconditional cache size: 415, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 19, Statistics for Abstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-24 12:35:40,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Forceful destruction successful, exit code 0 [2023-11-24 12:35:40,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Forceful destruction successful, exit code 0 [2023-11-24 12:35:40,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_Bitvector.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-?-2017400-m [2023-11-24 12:35:43,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 12:35:43,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Bitvector.epf [2023-11-24 12:35:43,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 12:35:43,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 12:35:43,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 12:35:43,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 12:35:43,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 12:35:43,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 12:35:43,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 12:35:43,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 12:35:43,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 12:35:43,194 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 12:35:43,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 12:35:43,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 12:35:43,196 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 12:35:43,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 12:35:43,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 12:35:43,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 12:35:43,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 12:35:43,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 12:35:43,197 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-24 12:35:43,197 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 12:35:43,197 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 12:35:43,197 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 12:35:43,198 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 12:35:43,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 12:35:43,198 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 12:35:43,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 12:35:43,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 12:35:43,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 12:35:43,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 12:35:43,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 12:35:43,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 12:35:43,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 12:35:43,200 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 12:35:43,201 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 12:35:43,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 12:35:43,201 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-24 12:35:43,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 12:35:43,202 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 12:35:43,202 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 12:35:43,202 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 12:35:43,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 12:35:43,203 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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 12:35:43,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 12:35:43,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 12:35:43,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 12:35:43,531 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 12:35:43,532 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 12:35:43,532 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 12:35:44,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 12:35:44,901 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 12:35:44,902 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr.i [2023-11-24 12:35:44,912 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/129da2e3e/9b0df8d5b94349418caf9aaa541d6f81/FLAG51ff673bc [2023-11-24 12:35:44,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/129da2e3e/9b0df8d5b94349418caf9aaa541d6f81 [2023-11-24 12:35:44,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 12:35:44,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 12:35:44,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 12:35:44,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 12:35:44,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 12:35:44,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:35:44" (1/1) ... [2023-11-24 12:35:44,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59e472ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:44, skipping insertion in model container [2023-11-24 12:35:44,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:35:44" (1/1) ... [2023-11-24 12:35:44,978 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 12:35:45,322 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 12:35:45,330 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 12:35:45,377 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 12:35:45,430 INFO L206 MainTranslator]: Completed translation [2023-11-24 12:35:45,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:45 WrapperNode [2023-11-24 12:35:45,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 12:35:45,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 12:35:45,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 12:35:45,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 12:35:45,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:45" (1/1) ... [2023-11-24 12:35:45,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:45" (1/1) ... [2023-11-24 12:35:45,493 INFO L138 Inliner]: procedures = 266, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-24 12:35:45,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 12:35:45,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 12:35:45,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 12:35:45,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 12:35:45,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:45" (1/1) ... [2023-11-24 12:35:45,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:45" (1/1) ... [2023-11-24 12:35:45,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:45" (1/1) ... [2023-11-24 12:35:45,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:45" (1/1) ... [2023-11-24 12:35:45,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:45" (1/1) ... [2023-11-24 12:35:45,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:45" (1/1) ... [2023-11-24 12:35:45,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:45" (1/1) ... [2023-11-24 12:35:45,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:45" (1/1) ... [2023-11-24 12:35:45,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 12:35:45,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 12:35:45,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 12:35:45,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 12:35:45,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:45" (1/1) ... [2023-11-24 12:35:45,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 12:35:45,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:35:45,602 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 12:35:45,620 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 12:35:45,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-24 12:35:45,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 12:35:45,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 12:35:45,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 12:35:45,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-24 12:35:45,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-24 12:35:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 12:35:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-24 12:35:45,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-24 12:35:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 12:35:45,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 12:35:45,658 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 12:35:45,832 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 12:35:45,835 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 12:35:46,129 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 12:35:46,140 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 12:35:46,141 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 12:35:46,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:35:46 BoogieIcfgContainer [2023-11-24 12:35:46,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 12:35:46,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 12:35:46,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 12:35:46,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 12:35:46,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:35:44" (1/3) ... [2023-11-24 12:35:46,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fc0875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:35:46, skipping insertion in model container [2023-11-24 12:35:46,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:45" (2/3) ... [2023-11-24 12:35:46,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fc0875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:35:46, skipping insertion in model container [2023-11-24 12:35:46,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:35:46" (3/3) ... [2023-11-24 12:35:46,156 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i [2023-11-24 12:35:46,161 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 12:35:46,170 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 12:35:46,170 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 12:35:46,171 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 12:35:46,264 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-24 12:35:46,306 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 12:35:46,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 12:35:46,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:35:46,308 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 12:35:46,320 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 12:35:46,364 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 12:35:46,372 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-24 12:35:46,377 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;@298c6087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 12:35:46,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 12:35:46,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:35:46,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:35:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2053799419, now seen corresponding path program 1 times [2023-11-24 12:35:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 12:35:46,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123854123] [2023-11-24 12:35:46,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:35:46,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 12:35:46,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 12:35:46,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 12:35:46,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-24 12:35:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:35:46,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-24 12:35:46,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:35:46,941 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 12:35:46,944 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 12:35:46,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 12:35:46,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123854123] [2023-11-24 12:35:46,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123854123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 12:35:46,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 12:35:46,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 12:35:46,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729639870] [2023-11-24 12:35:46,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 12:35:46,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 12:35:46,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 12:35:46,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 12:35:46,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 12:35:46,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:35:46,985 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:35:46,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 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 12:35:46,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:35:47,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:35:47,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-24 12:35:47,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 12:35:47,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:35:47,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:35:47,229 INFO L85 PathProgramCache]: Analyzing trace with hash -45782364, now seen corresponding path program 1 times [2023-11-24 12:35:47,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 12:35:47,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261710529] [2023-11-24 12:35:47,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:35:47,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 12:35:47,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 12:35:47,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 12:35:47,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-24 12:35:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:35:47,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-24 12:35:47,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:35:47,380 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 9 [2023-11-24 12:35:47,401 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 23 treesize of output 26 [2023-11-24 12:35:47,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:35:47,462 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 34 treesize of output 42 [2023-11-24 12:35:47,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:35:47,541 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 45 treesize of output 58 [2023-11-24 12:35:47,572 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 12:35:47,572 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 12:35:47,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 12:35:47,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261710529] [2023-11-24 12:35:47,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261710529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 12:35:47,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 12:35:47,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 12:35:47,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282173376] [2023-11-24 12:35:47,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 12:35:47,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 12:35:47,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 12:35:47,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 12:35:47,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 12:35:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:35:47,577 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:35:47,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 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 12:35:47,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:35:47,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:35:47,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:35:47,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:35:47,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-24 12:35:47,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 12:35:47,955 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:35:47,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:35:47,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1377495761, now seen corresponding path program 1 times [2023-11-24 12:35:47,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 12:35:47,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297501910] [2023-11-24 12:35:47,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:35:47,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 12:35:47,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 12:35:47,958 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 12:35:47,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-24 12:35:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:35:48,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-24 12:35:48,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:35:48,138 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 7 [2023-11-24 12:35:48,152 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 12:35:48,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-24 12:35:48,174 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 16 treesize of output 8 [2023-11-24 12:35:48,255 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 9 [2023-11-24 12:35:48,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2023-11-24 12:35:48,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:35:48,321 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 34 treesize of output 42 [2023-11-24 12:35:48,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:35:48,372 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 45 treesize of output 58 [2023-11-24 12:35:48,605 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 51 treesize of output 40 [2023-11-24 12:35:48,645 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 12:35:48,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:35:48,888 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (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_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) .cse1)) (_ bv0 1))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)))))))) is different from false [2023-11-24 12:35:48,906 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) (.cse1 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (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_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) .cse1)) (_ bv0 1))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))) (_ bv0 1))) (forall ((v_ArrVal_150 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_150) c_threadThread1of1ForFork0_~p~0.base) .cse2)) (_ bv0 1)))))) is different from false [2023-11-24 12:35:48,990 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 12:35:48,998 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 12:35:48,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 12:35:48,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297501910] [2023-11-24 12:35:48,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297501910] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:35:48,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 12:35:48,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2023-11-24 12:35:48,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135598585] [2023-11-24 12:35:48,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 12:35:48,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-24 12:35:49,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 12:35:49,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-24 12:35:49,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=164, Unknown=10, NotChecked=54, Total=272 [2023-11-24 12:35:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:35:49,001 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:35:49,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.5625) internal successors, (73), 17 states have internal predecessors, (73), 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 12:35:49,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:35:49,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:35:49,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:35:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:35:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:35:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:35:49,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-24 12:35:50,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 12:35:50,067 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:35:50,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:35:50,067 INFO L85 PathProgramCache]: Analyzing trace with hash -368462238, now seen corresponding path program 2 times [2023-11-24 12:35:50,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 12:35:50,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722718989] [2023-11-24 12:35:50,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 12:35:50,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 12:35:50,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 12:35:50,069 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 12:35:50,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-24 12:35:50,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 12:35:50,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 12:35:50,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-24 12:35:50,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:35:50,304 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 7 [2023-11-24 12:35:50,334 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 12:35:50,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-24 12:35:50,409 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 23 treesize of output 11 [2023-11-24 12:35:50,684 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 9 [2023-11-24 12:35:50,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2023-11-24 12:35:50,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:35:50,820 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 34 treesize of output 42 [2023-11-24 12:35:50,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:35:50,899 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 45 treesize of output 58 [2023-11-24 12:35:51,241 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 51 treesize of output 40 [2023-11-24 12:35:51,266 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 51 treesize of output 40 [2023-11-24 12:35:51,286 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 51 treesize of output 40 [2023-11-24 12:35:51,305 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 51 treesize of output 40 [2023-11-24 12:35:51,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:35:51,517 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 51 treesize of output 40 [2023-11-24 12:35:51,601 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 12:35:51,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:35:51,665 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (_ bv0 1))) (forall ((v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))) (_ bv0 1)))) is different from false [2023-11-24 12:35:51,958 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (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_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset))))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|) (_ bv0 1))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))))))))) is different from false [2023-11-24 12:35:51,975 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) (.cse1 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (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_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) .cse1)))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) .cse2)) (_ bv0 1))) (forall ((v_ArrVal_216 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_217 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_217) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))) (_ bv0 1)))))) is different from false [2023-11-24 12:35:52,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:35:52,099 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 38 treesize of output 62 [2023-11-24 12:35:52,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:35:52,106 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 110 treesize of output 68 [2023-11-24 12:35:52,110 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 46 treesize of output 42 [2023-11-24 12:35:52,114 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 26 treesize of output 24 [2023-11-24 12:35:52,137 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-11-24 12:35:52,137 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 40 treesize of output 1 [2023-11-24 12:35:52,142 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-11-24 12:35:52,142 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 40 treesize of output 1 [2023-11-24 12:35:52,147 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-11-24 12:35:52,148 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 40 treesize of output 1 [2023-11-24 12:35:52,436 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 12:35:52,554 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 12:35:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-24 12:35:52,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 12:35:52,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722718989] [2023-11-24 12:35:52,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722718989] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:35:52,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 12:35:52,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-11-24 12:35:52,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456040373] [2023-11-24 12:35:52,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 12:35:52,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-24 12:35:52,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 12:35:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-24 12:35:52,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=605, Unknown=16, NotChecked=156, Total=870 [2023-11-24 12:35:52,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:35:52,606 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:35:52,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.206896551724138) internal successors, (122), 30 states have internal predecessors, (122), 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 12:35:52,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:35:52,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:35:52,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:35:52,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:37:11,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:37:11,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:37:11,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:37:11,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-24 12:37:11,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-24 12:37:11,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 12:37:11,682 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:37:11,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:37:11,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2075374539, now seen corresponding path program 1 times [2023-11-24 12:37:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 12:37:11,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735301193] [2023-11-24 12:37:11,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:37:11,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 12:37:11,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 12:37:11,686 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 12:37:11,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-24 12:37:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:37:11,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-24 12:37:11,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:37:11,820 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 7 [2023-11-24 12:37:11,847 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-24 12:37:11,847 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 19 treesize of output 27 [2023-11-24 12:37:11,944 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-24 12:37:11,944 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 25 treesize of output 36 [2023-11-24 12:37:12,002 INFO L349 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2023-11-24 12:37:12,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 35 [2023-11-24 12:37:12,764 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-24 12:37:12,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 59 [2023-11-24 12:37:12,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 21 treesize of output 15 [2023-11-24 12:37:13,108 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:37:13,108 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 25 treesize of output 22 [2023-11-24 12:37:13,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 13 treesize of output 9 [2023-11-24 12:37:13,228 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 9 [2023-11-24 12:37:13,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2023-11-24 12:37:13,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:37:13,441 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 34 treesize of output 42 [2023-11-24 12:37:13,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:37:13,575 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 45 treesize of output 58 [2023-11-24 12:37:14,094 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 24 treesize of output 12 [2023-11-24 12:37:14,264 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:37:14,265 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 1 case distinctions, treesize of input 51 treesize of output 44 [2023-11-24 12:37:14,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2023-11-24 12:37:14,419 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:37:14,419 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 1 case distinctions, treesize of input 51 treesize of output 44 [2023-11-24 12:37:14,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:37:14,428 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 35 treesize of output 21 [2023-11-24 12:37:14,555 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:37:14,555 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 1 case distinctions, treesize of input 51 treesize of output 44 [2023-11-24 12:37:14,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2023-11-24 12:37:14,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:37:14,674 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 51 treesize of output 40 [2023-11-24 12:37:14,877 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 51 treesize of output 40 [2023-11-24 12:37:15,030 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 12:37:15,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:37:15,124 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset))))) (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))) (_ bv0 1))) (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))))) (forall ((v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1)))) is different from false [2023-11-24 12:37:15,352 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_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse0 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse0 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (_ bv0 1))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse0 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset))) (_ bv0 1))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse0 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))))))) is different from false [2023-11-24 12:37:15,530 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (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_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset))) (_ bv0 1))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|) (_ bv0 1))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2023-11-24 12:37:15,552 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) (.cse3 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (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_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) .cse3)) (_ bv0 1))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_288 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_287) .cse1 v_ArrVal_288) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))))))))) is different from false [2023-11-24 12:37:15,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:37:15,737 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 44 treesize of output 68 [2023-11-24 12:37:15,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:37:15,743 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 250 treesize of output 176 [2023-11-24 12:37:15,753 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 36 treesize of output 28 [2023-11-24 12:37:15,758 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 23 treesize of output 19 [2023-11-24 12:37:15,775 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-11-24 12:37:15,776 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 42 treesize of output 1 [2023-11-24 12:37:15,782 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-11-24 12:37:15,782 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 44 treesize of output 1 [2023-11-24 12:37:15,788 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-11-24 12:37:15,788 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 44 treesize of output 1 [2023-11-24 12:37:16,227 WARN L854 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| |c_ULTIMATE.start_main_#t~mem9#1.base|)) (forall ((v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|)))) is different from false [2023-11-24 12:37:17,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:37:17,034 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 102 treesize of output 91 [2023-11-24 12:37:17,041 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 53 treesize of output 51 [2023-11-24 12:37:19,451 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 12:37:19,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 12:37:19,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735301193] [2023-11-24 12:37:19,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735301193] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:37:19,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 12:37:19,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2023-11-24 12:37:19,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313315883] [2023-11-24 12:37:19,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 12:37:19,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-24 12:37:19,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 12:37:19,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-24 12:37:19,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1051, Unknown=26, NotChecked=350, Total=1560 [2023-11-24 12:37:19,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:37:19,454 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:37:19,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 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 12:37:19,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:37:19,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:37:19,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 12:37:19,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-24 12:37:19,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:37:23,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 12:37:25,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 12:37:33,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 12:37:44,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 12:39:16,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 12:39:42,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 12:40:02,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 12:40:03,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:40:03,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:40:03,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:40:03,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-24 12:40:03,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-24 12:40:03,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-24 12:40:03,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 12:40:03,663 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:40:03,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:40:03,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1384085133, now seen corresponding path program 2 times [2023-11-24 12:40:03,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 12:40:03,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65273787] [2023-11-24 12:40:03,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 12:40:03,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 12:40:03,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 12:40:03,665 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 12:40:03,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-24 12:40:03,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 12:40:03,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 12:40:03,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-24 12:40:03,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:40:03,825 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 7 [2023-11-24 12:40:03,853 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-24 12:40:03,853 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 19 treesize of output 27 [2023-11-24 12:40:03,962 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2023-11-24 12:40:03,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 32 treesize of output 44 [2023-11-24 12:40:04,042 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-24 12:40:04,042 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 2 case distinctions, treesize of input 24 treesize of output 26 [2023-11-24 12:40:05,014 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-11-24 12:40:05,014 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 2 case distinctions, treesize of input 59 treesize of output 55 [2023-11-24 12:40:05,487 INFO L349 Elim1Store]: treesize reduction 28, result has 34.9 percent of original size [2023-11-24 12:40:05,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 2 case distinctions, treesize of input 51 treesize of output 45 [2023-11-24 12:40:05,500 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 21 treesize of output 15 [2023-11-24 12:40:05,805 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 9 [2023-11-24 12:40:05,950 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 23 treesize of output 26 [2023-11-24 12:40:06,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:40:06,141 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 34 treesize of output 42 [2023-11-24 12:40:07,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:40:07,317 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 74 treesize of output 54 [2023-11-24 12:40:07,558 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:40:07,558 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 1 case distinctions, treesize of input 40 treesize of output 35 [2023-11-24 12:40:07,573 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 26 treesize of output 16 [2023-11-24 12:40:07,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:40:07,808 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 45 treesize of output 58 [2023-11-24 12:40:08,045 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:40:08,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 1 case distinctions, treesize of input 51 treesize of output 44 [2023-11-24 12:40:08,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:40:08,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 35 treesize of output 21 [2023-11-24 12:40:08,265 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:40:08,265 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 1 case distinctions, treesize of input 51 treesize of output 44 [2023-11-24 12:40:08,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:40:08,270 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 35 treesize of output 21 [2023-11-24 12:40:08,509 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 12:40:08,510 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 1 case distinctions, treesize of input 51 treesize of output 44 [2023-11-24 12:40:08,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:40:08,522 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 35 treesize of output 21 [2023-11-24 12:40:08,942 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 51 treesize of output 40 [2023-11-24 12:40:09,149 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 12:40:09,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:40:09,498 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))) (_ bv0 1))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)))))) is different from false [2023-11-24 12:40:09,536 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (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_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset))))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) .cse1))))))) is different from false [2023-11-24 12:40:09,554 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32)))))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|) (_ bv0 1))))) is different from false [2023-11-24 12:40:09,586 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset)) (.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_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) .cse1 v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) .cse0)) (_ bv0 1))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) .cse1 v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) .cse1 v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|) (_ bv0 1))) (forall ((v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_359 (Array (_ BitVec 32) (_ BitVec 1))) (v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_354) c_threadThread1of1ForFork0_~p~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_358) .cse1 v_ArrVal_359) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))) |c_threadThread1of1ForFork0_#t~nondet4|) (_ bv0 1))))) is different from false [2023-11-24 12:40:10,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:40:10,068 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 3 case distinctions, treesize of input 105 treesize of output 121 [2023-11-24 12:40:10,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:40:10,075 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 155 treesize of output 109 [2023-11-24 12:40:10,080 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 40 treesize of output 36 [2023-11-24 12:40:10,082 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 60 treesize of output 52 [2023-11-24 12:40:10,094 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:40:10,094 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:40:10,099 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2023-11-24 12:40:10,099 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 3 case distinctions, treesize of input 32 treesize of output 1 [2023-11-24 12:40:10,101 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:40:10,102 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:40:10,104 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:40:10,104 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:40:10,108 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2023-11-24 12:40:10,109 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 3 case distinctions, treesize of input 30 treesize of output 1 [2023-11-24 12:40:13,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:40:13,596 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 12:40:13,602 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 12:40:14,171 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 12:40:14,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 12:40:14,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65273787] [2023-11-24 12:40:14,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65273787] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:40:14,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 12:40:14,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2023-11-24 12:40:14,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175430733] [2023-11-24 12:40:14,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 12:40:14,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-24 12:40:14,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 12:40:14,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-24 12:40:14,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1175, Unknown=43, NotChecked=292, Total=1640 [2023-11-24 12:40:14,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:40:14,177 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:40:14,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 states have internal predecessors, (124), 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 12:40:14,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:40:14,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:40:14,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:40:14,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-24 12:40:14,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-24 12:40:14,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15