/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:34:15,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:34:15,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 03:34:15,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:34:15,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:34:15,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:34:15,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:34:15,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:34:15,573 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:34:15,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:34:15,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:34:15,577 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:34:15,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:34:15,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:34:15,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:34:15,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:34:15,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:34:15,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:34:15,580 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:34:15,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:34:15,580 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:34:15,581 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:34:15,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:34:15,581 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:34:15,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:34:15,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:34:15,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:34:15,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:34:15,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:34:15,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:34:15,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:34:15,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:34:15,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:34:15,584 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/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2023-11-30 03:34:15,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:34:15,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:34:15,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:34:15,853 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:34:15,853 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:34:15,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.i [2023-11-30 03:34:17,043 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:34:17,316 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:34:17,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.i [2023-11-30 03:34:17,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba0c31c3/62275b1b342d44b389b2dd40a258188a/FLAG408bace3a [2023-11-30 03:34:17,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba0c31c3/62275b1b342d44b389b2dd40a258188a [2023-11-30 03:34:17,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:34:17,354 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:34:17,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:34:17,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:34:17,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:34:17,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:34:17" (1/1) ... [2023-11-30 03:34:17,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a8be94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:17, skipping insertion in model container [2023-11-30 03:34:17,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:34:17" (1/1) ... [2023-11-30 03:34:17,397 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:34:17,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:34:17,731 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:34:17,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:34:17,825 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:34:17,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:17 WrapperNode [2023-11-30 03:34:17,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:34:17,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:34:17,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:34:17,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:34:17,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:17" (1/1) ... [2023-11-30 03:34:17,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:17" (1/1) ... [2023-11-30 03:34:17,881 INFO L138 Inliner]: procedures = 265, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2023-11-30 03:34:17,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:34:17,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:34:17,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:34:17,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:34:17,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:17" (1/1) ... [2023-11-30 03:34:17,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:17" (1/1) ... [2023-11-30 03:34:17,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:17" (1/1) ... [2023-11-30 03:34:17,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:17" (1/1) ... [2023-11-30 03:34:17,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:17" (1/1) ... [2023-11-30 03:34:17,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:17" (1/1) ... [2023-11-30 03:34:17,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:17" (1/1) ... [2023-11-30 03:34:17,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:17" (1/1) ... [2023-11-30 03:34:17,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:34:17,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:34:17,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:34:17,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:34:17,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:17" (1/1) ... [2023-11-30 03:34:17,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:34:17,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:34:17,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 03:34:17,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 03:34:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:34:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-30 03:34:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:34:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-30 03:34:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:34:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:34:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 03:34:17,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-30 03:34:17,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-30 03:34:17,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:34:17,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:34:17,976 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 03:34:18,106 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:34:18,111 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:34:18,359 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:34:18,370 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:34:18,370 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 03:34:18,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:34:18 BoogieIcfgContainer [2023-11-30 03:34:18,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:34:18,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:34:18,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:34:18,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:34:18,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:34:17" (1/3) ... [2023-11-30 03:34:18,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0ed9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:34:18, skipping insertion in model container [2023-11-30 03:34:18,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:17" (2/3) ... [2023-11-30 03:34:18,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0ed9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:34:18, skipping insertion in model container [2023-11-30 03:34:18,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:34:18" (3/3) ... [2023-11-30 03:34:18,379 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2023-11-30 03:34:18,395 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:34:18,395 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-30 03:34:18,395 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:34:18,449 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-30 03:34:18,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 136 transitions, 279 flow [2023-11-30 03:34:18,556 INFO L124 PetriNetUnfolderBase]: 6/219 cut-off events. [2023-11-30 03:34:18,557 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 03:34:18,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 219 events. 6/219 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 376 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. [2023-11-30 03:34:18,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 136 transitions, 279 flow [2023-11-30 03:34:18,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 136 transitions, 279 flow [2023-11-30 03:34:18,573 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:34:18,579 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@49d6376d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:34:18,579 INFO L363 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-30 03:34:18,588 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:34:18,589 INFO L124 PetriNetUnfolderBase]: 3/44 cut-off events. [2023-11-30 03:34:18,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:34:18,589 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:18,590 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:34:18,590 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:34:18,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:18,595 INFO L85 PathProgramCache]: Analyzing trace with hash 82393490, now seen corresponding path program 1 times [2023-11-30 03:34:18,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:18,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749114405] [2023-11-30 03:34:18,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:19,415 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-30 03:34:19,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:19,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749114405] [2023-11-30 03:34:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749114405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:19,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:19,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:34:19,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540152731] [2023-11-30 03:34:19,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:19,425 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:34:19,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:19,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:34:19,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:34:19,454 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 136 [2023-11-30 03:34:19,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 136 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-30 03:34:19,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:19,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 136 [2023-11-30 03:34:19,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:20,064 INFO L124 PetriNetUnfolderBase]: 307/977 cut-off events. [2023-11-30 03:34:20,064 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 03:34:20,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 977 events. 307/977 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5116 event pairs, 234 based on Foata normal form. 8/868 useless extension candidates. Maximal degree in co-relation 1499. Up to 551 conditions per place. [2023-11-30 03:34:20,106 INFO L140 encePairwiseOnDemand]: 116/136 looper letters, 97 selfloop transitions, 10 changer transitions 8/182 dead transitions. [2023-11-30 03:34:20,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 182 transitions, 599 flow [2023-11-30 03:34:20,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:34:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:34:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 530 transitions. [2023-11-30 03:34:20,134 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6495098039215687 [2023-11-30 03:34:20,135 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 530 transitions. [2023-11-30 03:34:20,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 530 transitions. [2023-11-30 03:34:20,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:20,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 530 transitions. [2023-11-30 03:34:20,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 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-30 03:34:20,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-30 03:34:20,163 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-30 03:34:20,168 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 2 predicate places. [2023-11-30 03:34:20,169 INFO L500 AbstractCegarLoop]: Abstraction has has 137 places, 182 transitions, 599 flow [2023-11-30 03:34:20,169 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-30 03:34:20,169 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:20,170 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:34:20,170 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:34:20,170 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:34:20,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:20,171 INFO L85 PathProgramCache]: Analyzing trace with hash 213058564, now seen corresponding path program 1 times [2023-11-30 03:34:20,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:20,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046466176] [2023-11-30 03:34:20,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:20,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:20,285 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-30 03:34:20,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:20,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046466176] [2023-11-30 03:34:20,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046466176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:20,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:20,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:34:20,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11639955] [2023-11-30 03:34:20,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:20,289 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 03:34:20,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:20,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 03:34:20,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 03:34:20,293 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 136 [2023-11-30 03:34:20,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 182 transitions, 599 flow. Second operand has 5 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 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-30 03:34:20,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:20,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 136 [2023-11-30 03:34:20,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:20,526 INFO L124 PetriNetUnfolderBase]: 307/972 cut-off events. [2023-11-30 03:34:20,526 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-30 03:34:20,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 972 events. 307/972 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4997 event pairs, 234 based on Foata normal form. 0/856 useless extension candidates. Maximal degree in co-relation 1620. Up to 553 conditions per place. [2023-11-30 03:34:20,531 INFO L140 encePairwiseOnDemand]: 128/136 looper letters, 43 selfloop transitions, 6 changer transitions 8/185 dead transitions. [2023-11-30 03:34:20,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 185 transitions, 695 flow [2023-11-30 03:34:20,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:34:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:34:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 639 transitions. [2023-11-30 03:34:20,537 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7830882352941176 [2023-11-30 03:34:20,537 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 639 transitions. [2023-11-30 03:34:20,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 639 transitions. [2023-11-30 03:34:20,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:20,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 639 transitions. [2023-11-30 03:34:20,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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-30 03:34:20,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-30 03:34:20,543 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-30 03:34:20,543 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 7 predicate places. [2023-11-30 03:34:20,544 INFO L500 AbstractCegarLoop]: Abstraction has has 142 places, 185 transitions, 695 flow [2023-11-30 03:34:20,544 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 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-30 03:34:20,544 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:20,544 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:34:20,544 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:34:20,545 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:34:20,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1682416842, now seen corresponding path program 1 times [2023-11-30 03:34:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:20,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098428128] [2023-11-30 03:34:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:20,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:20,899 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-30 03:34:20,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:20,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098428128] [2023-11-30 03:34:20,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098428128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:20,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:20,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:34:20,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484456113] [2023-11-30 03:34:20,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:20,903 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:34:20,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:20,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:34:20,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:34:20,905 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 136 [2023-11-30 03:34:20,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 185 transitions, 695 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-30 03:34:20,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:20,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 136 [2023-11-30 03:34:20,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:21,220 INFO L124 PetriNetUnfolderBase]: 319/971 cut-off events. [2023-11-30 03:34:21,221 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2023-11-30 03:34:21,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 971 events. 319/971 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4936 event pairs, 198 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 2274. Up to 541 conditions per place. [2023-11-30 03:34:21,227 INFO L140 encePairwiseOnDemand]: 123/136 looper letters, 112 selfloop transitions, 6 changer transitions 18/207 dead transitions. [2023-11-30 03:34:21,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 207 transitions, 1039 flow [2023-11-30 03:34:21,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:34:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:34:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 505 transitions. [2023-11-30 03:34:21,229 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6188725490196079 [2023-11-30 03:34:21,229 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 505 transitions. [2023-11-30 03:34:21,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 505 transitions. [2023-11-30 03:34:21,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:21,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 505 transitions. [2023-11-30 03:34:21,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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-30 03:34:21,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-30 03:34:21,233 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-30 03:34:21,234 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 9 predicate places. [2023-11-30 03:34:21,234 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 207 transitions, 1039 flow [2023-11-30 03:34:21,234 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-30 03:34:21,234 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:21,234 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:34:21,234 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:34:21,235 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:34:21,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash -899302659, now seen corresponding path program 1 times [2023-11-30 03:34:21,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:21,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434203122] [2023-11-30 03:34:21,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:21,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:21,589 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-30 03:34:21,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:21,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434203122] [2023-11-30 03:34:21,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434203122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:21,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:21,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:34:21,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586578008] [2023-11-30 03:34:21,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:21,590 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:34:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:21,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:34:21,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:34:21,596 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 136 [2023-11-30 03:34:21,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 207 transitions, 1039 flow. Second operand has 6 states, 6 states have (on average 65.66666666666667) internal successors, (394), 6 states have internal predecessors, (394), 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-30 03:34:21,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:21,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 136 [2023-11-30 03:34:21,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:21,851 INFO L124 PetriNetUnfolderBase]: 403/1164 cut-off events. [2023-11-30 03:34:21,851 INFO L125 PetriNetUnfolderBase]: For 471/471 co-relation queries the response was YES. [2023-11-30 03:34:21,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3953 conditions, 1164 events. 403/1164 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6135 event pairs, 248 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 3574. Up to 826 conditions per place. [2023-11-30 03:34:21,859 INFO L140 encePairwiseOnDemand]: 125/136 looper letters, 129 selfloop transitions, 26 changer transitions 18/235 dead transitions. [2023-11-30 03:34:21,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 235 transitions, 1543 flow [2023-11-30 03:34:21,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:34:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:34:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 472 transitions. [2023-11-30 03:34:21,861 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2023-11-30 03:34:21,861 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 472 transitions. [2023-11-30 03:34:21,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 472 transitions. [2023-11-30 03:34:21,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:21,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 472 transitions. [2023-11-30 03:34:21,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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-30 03:34:21,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-30 03:34:21,865 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-30 03:34:21,865 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 14 predicate places. [2023-11-30 03:34:21,865 INFO L500 AbstractCegarLoop]: Abstraction has has 149 places, 235 transitions, 1543 flow [2023-11-30 03:34:21,866 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.66666666666667) internal successors, (394), 6 states have internal predecessors, (394), 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-30 03:34:21,866 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:21,866 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:34:21,866 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:34:21,866 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:34:21,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1880402312, now seen corresponding path program 1 times [2023-11-30 03:34:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:21,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266062896] [2023-11-30 03:34:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:22,309 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-30 03:34:22,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:22,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266062896] [2023-11-30 03:34:22,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266062896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:22,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:22,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:34:22,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850321332] [2023-11-30 03:34:22,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:22,310 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:34:22,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:22,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:34:22,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:34:22,312 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 136 [2023-11-30 03:34:22,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 235 transitions, 1543 flow. Second operand has 6 states, 6 states have (on average 79.66666666666667) internal successors, (478), 6 states have internal predecessors, (478), 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-30 03:34:22,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:22,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 136 [2023-11-30 03:34:22,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:23,011 INFO L124 PetriNetUnfolderBase]: 522/1637 cut-off events. [2023-11-30 03:34:23,011 INFO L125 PetriNetUnfolderBase]: For 1029/1055 co-relation queries the response was YES. [2023-11-30 03:34:23,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6066 conditions, 1637 events. 522/1637 cut-off events. For 1029/1055 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 10217 event pairs, 163 based on Foata normal form. 0/1563 useless extension candidates. Maximal degree in co-relation 5625. Up to 1003 conditions per place. [2023-11-30 03:34:23,022 INFO L140 encePairwiseOnDemand]: 126/136 looper letters, 225 selfloop transitions, 75 changer transitions 82/447 dead transitions. [2023-11-30 03:34:23,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 447 transitions, 4061 flow [2023-11-30 03:34:23,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:34:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:34:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 675 transitions. [2023-11-30 03:34:23,025 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8272058823529411 [2023-11-30 03:34:23,025 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 675 transitions. [2023-11-30 03:34:23,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 675 transitions. [2023-11-30 03:34:23,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:23,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 675 transitions. [2023-11-30 03:34:23,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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-30 03:34:23,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-30 03:34:23,028 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-30 03:34:23,029 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 19 predicate places. [2023-11-30 03:34:23,029 INFO L500 AbstractCegarLoop]: Abstraction has has 154 places, 447 transitions, 4061 flow [2023-11-30 03:34:23,029 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.66666666666667) internal successors, (478), 6 states have internal predecessors, (478), 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-30 03:34:23,029 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:23,030 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:34:23,030 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:34:23,030 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:34:23,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:23,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1345881083, now seen corresponding path program 1 times [2023-11-30 03:34:23,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:23,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014617239] [2023-11-30 03:34:23,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:23,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 03:34:23,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:23,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014617239] [2023-11-30 03:34:23,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014617239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:23,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:23,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:34:23,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646235736] [2023-11-30 03:34:23,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:23,420 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:34:23,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:23,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:34:23,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:34:23,422 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 136 [2023-11-30 03:34:23,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 447 transitions, 4061 flow. Second operand has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 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-30 03:34:23,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:23,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 136 [2023-11-30 03:34:23,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:23,765 INFO L124 PetriNetUnfolderBase]: 540/1627 cut-off events. [2023-11-30 03:34:23,765 INFO L125 PetriNetUnfolderBase]: For 1942/1966 co-relation queries the response was YES. [2023-11-30 03:34:23,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7119 conditions, 1627 events. 540/1627 cut-off events. For 1942/1966 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9888 event pairs, 186 based on Foata normal form. 0/1562 useless extension candidates. Maximal degree in co-relation 6617. Up to 1014 conditions per place. [2023-11-30 03:34:23,777 INFO L140 encePairwiseOnDemand]: 130/136 looper letters, 243 selfloop transitions, 0 changer transitions 166/462 dead transitions. [2023-11-30 03:34:23,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 462 transitions, 4975 flow [2023-11-30 03:34:23,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:34:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:34:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 477 transitions. [2023-11-30 03:34:23,779 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5845588235294118 [2023-11-30 03:34:23,779 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 477 transitions. [2023-11-30 03:34:23,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 477 transitions. [2023-11-30 03:34:23,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:23,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 477 transitions. [2023-11-30 03:34:23,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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-30 03:34:23,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-30 03:34:23,782 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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-30 03:34:23,783 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 23 predicate places. [2023-11-30 03:34:23,783 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 462 transitions, 4975 flow [2023-11-30 03:34:23,783 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 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-30 03:34:23,783 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:23,784 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:34:23,784 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:34:23,784 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:34:23,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:23,784 INFO L85 PathProgramCache]: Analyzing trace with hash 331857309, now seen corresponding path program 1 times [2023-11-30 03:34:23,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:23,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413099765] [2023-11-30 03:34:23,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:23,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:25,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:25,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413099765] [2023-11-30 03:34:25,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413099765] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:34:25,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702048170] [2023-11-30 03:34:25,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:25,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:34:25,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:34:25,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:34:25,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-30 03:34:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:25,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-30 03:34:25,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:34:25,537 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-30 03:34:25,567 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:34:25,568 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-30 03:34:25,784 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-30 03:34:25,784 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 33 treesize of output 33 [2023-11-30 03:34:25,802 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-30 03:34:26,462 INFO L349 Elim1Store]: treesize reduction 56, result has 36.4 percent of original size [2023-11-30 03:34:26,462 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 6 case distinctions, treesize of input 63 treesize of output 74 [2023-11-30 03:34:26,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:26,487 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-30 03:34:26,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 5 treesize of output 3 [2023-11-30 03:34:26,859 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-30 03:34:26,864 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-30 03:34:27,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-30 03:34:27,080 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-30 03:34:27,146 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-30 03:34:27,217 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-30 03:34:27,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:27,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:27,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:27,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:27,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:34:27,332 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 58 treesize of output 47 [2023-11-30 03:34:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:27,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:34:28,169 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 28 treesize of output 24 [2023-11-30 03:34:30,464 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_14| Int)) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |v_ULTIMATE.start_main_#t~mem8#1.base_14|) (forall ((v_ArrVal_360 (Array Int Int)) (v_ArrVal_361 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_14| v_ArrVal_360))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_361) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (not (= .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|)))))))) is different from false [2023-11-30 03:34:30,722 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 20 treesize of output 18 [2023-11-30 03:34:30,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:34:30,827 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 101 [2023-11-30 03:34:30,842 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 48 treesize of output 42 [2023-11-30 03:34:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-30 03:34:30,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702048170] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:34:30,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:34:30,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 57 [2023-11-30 03:34:30,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713244004] [2023-11-30 03:34:30,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:34:30,985 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-30 03:34:30,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:30,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-30 03:34:30,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2944, Unknown=35, NotChecked=110, Total=3306 [2023-11-30 03:34:30,990 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:34:30,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 462 transitions, 4975 flow. Second operand has 58 states, 58 states have (on average 40.793103448275865) internal successors, (2366), 58 states have internal predecessors, (2366), 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-30 03:34:30,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:30,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:34:30,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:37,575 INFO L124 PetriNetUnfolderBase]: 843/2453 cut-off events. [2023-11-30 03:34:37,575 INFO L125 PetriNetUnfolderBase]: For 3538/3544 co-relation queries the response was YES. [2023-11-30 03:34:37,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12012 conditions, 2453 events. 843/2453 cut-off events. For 3538/3544 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 15721 event pairs, 10 based on Foata normal form. 0/2384 useless extension candidates. Maximal degree in co-relation 11418. Up to 1388 conditions per place. [2023-11-30 03:34:37,595 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 474 selfloop transitions, 132 changer transitions 216/844 dead transitions. [2023-11-30 03:34:37,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 844 transitions, 10707 flow [2023-11-30 03:34:37,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-30 03:34:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-11-30 03:34:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 2191 transitions. [2023-11-30 03:34:37,602 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3356311274509804 [2023-11-30 03:34:37,602 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 2191 transitions. [2023-11-30 03:34:37,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 2191 transitions. [2023-11-30 03:34:37,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:37,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 2191 transitions. [2023-11-30 03:34:37,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 45.645833333333336) internal successors, (2191), 48 states have internal predecessors, (2191), 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-30 03:34:37,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 136.0) internal successors, (6664), 49 states have internal predecessors, (6664), 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-30 03:34:37,618 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 136.0) internal successors, (6664), 49 states have internal predecessors, (6664), 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-30 03:34:37,618 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 70 predicate places. [2023-11-30 03:34:37,618 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 844 transitions, 10707 flow [2023-11-30 03:34:37,619 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 40.793103448275865) internal successors, (2366), 58 states have internal predecessors, (2366), 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-30 03:34:37,620 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:37,620 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:34:37,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-30 03:34:37,825 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:34:37,825 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:34:37,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:37,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1958933017, now seen corresponding path program 2 times [2023-11-30 03:34:37,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:37,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411125221] [2023-11-30 03:34:37,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:37,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:40,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411125221] [2023-11-30 03:34:40,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411125221] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:34:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632361499] [2023-11-30 03:34:40,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 03:34:40,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:34:40,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:34:40,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:34:40,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-30 03:34:40,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 03:34:40,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:34:40,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-30 03:34:40,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:34:40,878 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-30 03:34:40,879 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-30 03:34:40,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:40,890 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-30 03:34:41,442 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:34:41,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 70 [2023-11-30 03:34:41,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:41,453 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 24 treesize of output 11 [2023-11-30 03:34:41,789 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-30 03:34:41,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:34:41,991 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 26 treesize of output 28 [2023-11-30 03:34:42,102 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 33 treesize of output 38 [2023-11-30 03:34:42,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:34:42,606 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-30 03:34:42,619 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-30 03:34:42,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:42,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 37 treesize of output 26 [2023-11-30 03:34:42,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:42,712 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-30 03:34:42,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:42,731 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-30 03:34:42,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:42,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 37 treesize of output 26 [2023-11-30 03:34:42,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:42,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:42,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:42,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:42,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:34:42,862 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 52 treesize of output 41 [2023-11-30 03:34:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:42,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:34:43,096 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false [2023-11-30 03:34:43,158 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))))) is different from false [2023-11-30 03:34:45,303 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0))))))) is different from false [2023-11-30 03:34:45,410 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))))) is different from false [2023-11-30 03:34:45,683 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1)))))) is different from false [2023-11-30 03:35:02,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:02,968 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 79 treesize of output 72 [2023-11-30 03:35:02,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:02,980 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 232 treesize of output 220 [2023-11-30 03:35:02,995 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 177 treesize of output 169 [2023-11-30 03:35:03,007 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 31 treesize of output 17 [2023-11-30 03:35:03,031 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 140 treesize of output 122 [2023-11-30 03:35:03,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:03,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-30 03:35:03,180 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:35:03,192 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-30 03:35:03,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130 [2023-11-30 03:35:03,204 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 48 treesize of output 44 [2023-11-30 03:35:03,213 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 80 treesize of output 62 [2023-11-30 03:35:03,238 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:35:03,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-30 03:35:03,245 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:35:03,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-30 03:35:08,094 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_523 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_523))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select (store .cse0 .cse1 v_ArrVal_525) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_526 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_524))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_526) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_523 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_523) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-30 03:35:08,161 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_17| Int)) (or (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_523 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_17| v_ArrVal_523))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_525) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_526 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_17| v_ArrVal_524))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_526) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (< .cse3 |v_ULTIMATE.start_main_#t~mem8#1.base_17|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_17| Int)) (or (< .cse3 |v_ULTIMATE.start_main_#t~mem8#1.base_17|) (forall ((v_ArrVal_523 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_17| v_ArrVal_523) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))))))) is different from false [2023-11-30 03:35:08,251 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 376 treesize of output 340 [2023-11-30 03:35:08,275 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 22 treesize of output 18 [2023-11-30 03:35:08,281 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-30 03:35:08,550 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 20 treesize of output 18 [2023-11-30 03:35:08,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:08,703 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-30 03:35:08,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:08,718 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 33 treesize of output 35 [2023-11-30 03:35:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:35:08,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632361499] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:35:08,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:35:08,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 24] total 71 [2023-11-30 03:35:08,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9162643] [2023-11-30 03:35:08,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:35:08,877 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-30 03:35:08,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:35:08,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-30 03:35:08,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=3791, Unknown=75, NotChecked=924, Total=5112 [2023-11-30 03:35:08,882 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:35:08,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 844 transitions, 10707 flow. Second operand has 72 states, 72 states have (on average 40.47222222222222) internal successors, (2914), 72 states have internal predecessors, (2914), 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-30 03:35:08,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:35:08,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:35:08,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:35:23,937 INFO L124 PetriNetUnfolderBase]: 923/2787 cut-off events. [2023-11-30 03:35:23,937 INFO L125 PetriNetUnfolderBase]: For 4820/4834 co-relation queries the response was YES. [2023-11-30 03:35:23,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15992 conditions, 2787 events. 923/2787 cut-off events. For 4820/4834 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 18972 event pairs, 10 based on Foata normal form. 4/2715 useless extension candidates. Maximal degree in co-relation 15057. Up to 1613 conditions per place. [2023-11-30 03:35:23,961 INFO L140 encePairwiseOnDemand]: 102/136 looper letters, 616 selfloop transitions, 143 changer transitions 292/1073 dead transitions. [2023-11-30 03:35:23,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1073 transitions, 15422 flow [2023-11-30 03:35:23,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-30 03:35:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-11-30 03:35:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 1809 transitions. [2023-11-30 03:35:23,968 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3410633484162896 [2023-11-30 03:35:23,968 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 1809 transitions. [2023-11-30 03:35:23,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 1809 transitions. [2023-11-30 03:35:23,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:35:23,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 1809 transitions. [2023-11-30 03:35:23,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 46.38461538461539) internal successors, (1809), 39 states have internal predecessors, (1809), 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-30 03:35:23,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 136.0) internal successors, (5440), 40 states have internal predecessors, (5440), 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-30 03:35:23,982 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 136.0) internal successors, (5440), 40 states have internal predecessors, (5440), 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-30 03:35:23,982 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 108 predicate places. [2023-11-30 03:35:23,983 INFO L500 AbstractCegarLoop]: Abstraction has has 243 places, 1073 transitions, 15422 flow [2023-11-30 03:35:23,984 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 40.47222222222222) internal successors, (2914), 72 states have internal predecessors, (2914), 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-30 03:35:23,984 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:35:23,984 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:35:23,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-30 03:35:24,190 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-30 03:35:24,190 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:35:24,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:35:24,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1774293041, now seen corresponding path program 3 times [2023-11-30 03:35:24,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:35:24,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367503231] [2023-11-30 03:35:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:35:24,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:35:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:35:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:35:26,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:35:26,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367503231] [2023-11-30 03:35:26,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367503231] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:35:26,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95551891] [2023-11-30 03:35:26,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 03:35:26,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:35:26,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:35:26,211 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:35:26,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-30 03:35:26,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-30 03:35:26,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:35:26,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-30 03:35:26,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:35:26,973 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-30 03:35:26,974 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-30 03:35:26,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:26,981 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-30 03:35:27,602 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:35:27,603 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 76 treesize of output 70 [2023-11-30 03:35:27,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:27,611 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 24 treesize of output 11 [2023-11-30 03:35:28,014 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-30 03:35:28,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:35:28,208 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 26 treesize of output 28 [2023-11-30 03:35:28,537 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 33 treesize of output 38 [2023-11-30 03:35:28,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:28,758 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-30 03:35:28,770 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-30 03:35:28,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:28,833 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-30 03:35:28,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:28,862 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-30 03:35:28,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:28,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 37 treesize of output 26 [2023-11-30 03:35:28,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:28,911 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-30 03:35:29,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:29,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:29,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:29,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:29,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:29,030 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 52 treesize of output 41 [2023-11-30 03:35:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:35:29,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:35:29,260 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false [2023-11-30 03:35:29,326 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse3) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse3) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse3) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse3) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) is different from false [2023-11-30 03:35:34,012 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse4)))))) is different from false [2023-11-30 03:35:34,125 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (and (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1) (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0))) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1) (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false [2023-11-30 03:35:34,243 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse6 0)))) (and (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1) (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0))) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1) (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0))) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1) (= (select (select (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false [2023-11-30 03:35:34,361 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0) .cse5 0) .cse9 0)))) (and (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1))) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1))) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1) (= (select (select (let ((.cse10 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_704))) (store .cse10 .cse3 (store (select .cse10 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_706))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false [2023-11-30 03:35:34,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:34,398 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 79 treesize of output 72 [2023-11-30 03:35:34,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:34,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 412 treesize of output 384 [2023-11-30 03:35:34,425 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 170 treesize of output 162 [2023-11-30 03:35:34,458 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 31 treesize of output 17 [2023-11-30 03:35:34,468 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 137 treesize of output 119 [2023-11-30 03:35:34,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:34,606 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 81 treesize of output 74 [2023-11-30 03:35:34,610 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:35:34,622 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-30 03:35:34,622 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 144 treesize of output 130 [2023-11-30 03:35:34,638 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 80 treesize of output 62 [2023-11-30 03:35:34,647 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 48 treesize of output 44 [2023-11-30 03:35:34,671 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:35:34,671 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 81 treesize of output 1 [2023-11-30 03:35:34,680 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:35:34,680 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 81 treesize of output 1 [2023-11-30 03:35:37,244 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_692))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_693 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_693) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_694 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_691))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_694) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_692 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false [2023-11-30 03:35:37,319 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_20| Int)) (or (forall ((v_ArrVal_692 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_20| v_ArrVal_692) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_20|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_20| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_20|) (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_20| v_ArrVal_692))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_694 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_20| v_ArrVal_691))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_694) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_693 (Array Int Int))) (not (= (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse3 .cse2 v_ArrVal_693) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))))) is different from false [2023-11-30 03:35:37,386 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 376 treesize of output 340 [2023-11-30 03:35:37,396 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 11 treesize of output 9 [2023-11-30 03:35:37,401 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 20 treesize of output 16 [2023-11-30 03:35:37,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 20 treesize of output 18 [2023-11-30 03:35:37,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:37,783 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-30 03:35:37,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:37,794 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 33 treesize of output 35 [2023-11-30 03:35:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:35:37,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95551891] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:35:37,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:35:37,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 24] total 71 [2023-11-30 03:35:37,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905073610] [2023-11-30 03:35:37,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:35:37,916 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-30 03:35:37,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:35:37,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-30 03:35:37,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=3748, Unknown=24, NotChecked=1048, Total=5112 [2023-11-30 03:35:37,921 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:35:37,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 1073 transitions, 15422 flow. Second operand has 72 states, 72 states have (on average 40.47222222222222) internal successors, (2914), 72 states have internal predecessors, (2914), 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-30 03:35:37,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:35:37,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:35:37,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:35:47,214 INFO L124 PetriNetUnfolderBase]: 1023/3223 cut-off events. [2023-11-30 03:35:47,214 INFO L125 PetriNetUnfolderBase]: For 6693/6717 co-relation queries the response was YES. [2023-11-30 03:35:47,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20961 conditions, 3223 events. 1023/3223 cut-off events. For 6693/6717 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 23479 event pairs, 22 based on Foata normal form. 10/3149 useless extension candidates. Maximal degree in co-relation 19623. Up to 1882 conditions per place. [2023-11-30 03:35:47,230 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 720 selfloop transitions, 171 changer transitions 370/1283 dead transitions. [2023-11-30 03:35:47,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 1283 transitions, 20881 flow [2023-11-30 03:35:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-30 03:35:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-30 03:35:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 1944 transitions. [2023-11-30 03:35:47,235 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3403361344537815 [2023-11-30 03:35:47,235 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 1944 transitions. [2023-11-30 03:35:47,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 1944 transitions. [2023-11-30 03:35:47,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:35:47,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 1944 transitions. [2023-11-30 03:35:47,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 46.285714285714285) internal successors, (1944), 42 states have internal predecessors, (1944), 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-30 03:35:47,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 136.0) internal successors, (5848), 43 states have internal predecessors, (5848), 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-30 03:35:47,248 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 136.0) internal successors, (5848), 43 states have internal predecessors, (5848), 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-30 03:35:47,248 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 149 predicate places. [2023-11-30 03:35:47,248 INFO L500 AbstractCegarLoop]: Abstraction has has 284 places, 1283 transitions, 20881 flow [2023-11-30 03:35:47,249 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 40.47222222222222) internal successors, (2914), 72 states have internal predecessors, (2914), 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-30 03:35:47,250 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:35:47,250 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:35:47,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-30 03:35:47,459 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:35:47,459 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:35:47,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:35:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1764534327, now seen corresponding path program 4 times [2023-11-30 03:35:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:35:47,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740911555] [2023-11-30 03:35:47,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:35:47,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:35:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:35:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:35:49,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:35:49,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740911555] [2023-11-30 03:35:49,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740911555] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:35:49,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880357572] [2023-11-30 03:35:49,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-30 03:35:49,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:35:49,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:35:49,135 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:35:49,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-30 03:35:49,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-30 03:35:49,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:35:49,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-30 03:35:49,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:35:50,002 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-30 03:35:50,002 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-30 03:35:50,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:50,012 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-30 03:35:50,518 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:35:50,518 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 76 treesize of output 70 [2023-11-30 03:35:50,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:50,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 24 treesize of output 11 [2023-11-30 03:35:50,918 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-30 03:35:51,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:35:51,187 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 26 treesize of output 28 [2023-11-30 03:35:51,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:51,682 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-30 03:35:51,694 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-30 03:35:51,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:51,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-30 03:35:51,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:51,806 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 30 treesize of output 21 [2023-11-30 03:35:51,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:51,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-30 03:35:51,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:51,852 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 30 treesize of output 21 [2023-11-30 03:35:51,918 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 33 treesize of output 38 [2023-11-30 03:35:52,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:52,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:52,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:52,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:52,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:52,031 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 52 treesize of output 41 [2023-11-30 03:35:52,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:35:52,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:35:52,413 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_874 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_874 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_874 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_874 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false [2023-11-30 03:35:52,505 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_874 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse5) (forall ((v_ArrVal_874 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_874 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_874 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse5))))) is different from false [2023-11-30 03:35:54,597 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_874 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_874 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_874 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_874 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))))) is different from false [2023-11-30 03:35:54,674 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_874 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((v_ArrVal_874 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((v_ArrVal_874 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((v_ArrVal_874 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))))) is different from false [2023-11-30 03:35:54,782 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_874 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((v_ArrVal_874 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((v_ArrVal_874 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((v_ArrVal_874 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5)))))) is different from false [2023-11-30 03:35:54,856 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0) .cse7 0))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_874 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= 0 (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) .cse3)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((v_ArrVal_874 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((v_ArrVal_874 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((v_ArrVal_874 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_874))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5)))))) is different from false [2023-11-30 03:35:54,901 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-30 03:35:54,901 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 714 treesize of output 536 [2023-11-30 03:35:54,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:54,940 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 228 treesize of output 224 [2023-11-30 03:35:54,952 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 206 treesize of output 198 [2023-11-30 03:35:55,049 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:35:55,076 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-11-30 03:35:55,076 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 498 treesize of output 441 [2023-11-30 03:35:55,085 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:35:55,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 73 [2023-11-30 03:35:55,112 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:35:55,122 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-30 03:35:55,122 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 746 treesize of output 1 [2023-11-30 03:35:55,127 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:35:55,137 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-30 03:35:55,138 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 746 treesize of output 1 [2023-11-30 03:35:55,736 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_859 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_859))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_862 (Array Int Int))) (not (= (select (select (store .cse0 .cse1 v_ArrVal_862) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_861 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_860))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_861) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))))) is different from false [2023-11-30 03:35:55,789 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_23| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_23|) (forall ((v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_23| v_ArrVal_859))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_861 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_23| v_ArrVal_860))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_861) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_862 (Array Int Int))) (not (= (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse3 .cse2 v_ArrVal_862) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_23| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_23|) (forall ((v_ArrVal_859 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_23| v_ArrVal_859) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))))))) is different from false [2023-11-30 03:35:55,836 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 222 treesize of output 202 [2023-11-30 03:35:55,844 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 50 treesize of output 46 [2023-11-30 03:35:55,856 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 21 [2023-11-30 03:35:56,111 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 20 treesize of output 18 [2023-11-30 03:35:56,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:56,214 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-30 03:35:56,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:56,228 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 33 treesize of output 35 [2023-11-30 03:35:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:35:56,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880357572] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:35:56,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:35:56,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 70 [2023-11-30 03:35:56,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989380328] [2023-11-30 03:35:56,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:35:56,359 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-30 03:35:56,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:35:56,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-30 03:35:56,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=3632, Unknown=22, NotChecked=1032, Total=4970 [2023-11-30 03:35:56,363 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:35:56,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 1283 transitions, 20881 flow. Second operand has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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-30 03:35:56,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:35:56,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:35:56,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:36:05,478 INFO L124 PetriNetUnfolderBase]: 1069/3420 cut-off events. [2023-11-30 03:36:05,478 INFO L125 PetriNetUnfolderBase]: For 8692/8714 co-relation queries the response was YES. [2023-11-30 03:36:05,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24870 conditions, 3420 events. 1069/3420 cut-off events. For 8692/8714 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 25700 event pairs, 12 based on Foata normal form. 8/3341 useless extension candidates. Maximal degree in co-relation 23374. Up to 1994 conditions per place. [2023-11-30 03:36:05,497 INFO L140 encePairwiseOnDemand]: 102/136 looper letters, 799 selfloop transitions, 193 changer transitions 370/1384 dead transitions. [2023-11-30 03:36:05,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 1384 transitions, 25329 flow [2023-11-30 03:36:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-30 03:36:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-11-30 03:36:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 2036 transitions. [2023-11-30 03:36:05,502 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.34024064171123 [2023-11-30 03:36:05,502 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 2036 transitions. [2023-11-30 03:36:05,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 2036 transitions. [2023-11-30 03:36:05,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:36:05,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 2036 transitions. [2023-11-30 03:36:05,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 46.27272727272727) internal successors, (2036), 44 states have internal predecessors, (2036), 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-30 03:36:05,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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-30 03:36:05,513 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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-30 03:36:05,514 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 192 predicate places. [2023-11-30 03:36:05,514 INFO L500 AbstractCegarLoop]: Abstraction has has 327 places, 1384 transitions, 25329 flow [2023-11-30 03:36:05,515 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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-30 03:36:05,515 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:36:05,515 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:36:05,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-30 03:36:05,721 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:36:05,721 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:36:05,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:36:05,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1603382477, now seen corresponding path program 5 times [2023-11-30 03:36:05,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:36:05,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452955641] [2023-11-30 03:36:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:36:05,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:36:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:36:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:36:07,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:36:07,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452955641] [2023-11-30 03:36:07,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452955641] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:36:07,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436168432] [2023-11-30 03:36:07,490 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-30 03:36:07,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:36:07,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:36:07,491 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:36:07,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-30 03:36:07,744 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 03:36:07,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:36:07,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-30 03:36:07,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:36:07,768 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-30 03:36:07,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:36:07,808 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 12 treesize of output 14 [2023-11-30 03:36:07,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:36:07,906 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-11-30 03:36:07,906 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 26 treesize of output 41 [2023-11-30 03:36:07,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:36:07,976 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2023-11-30 03:36:07,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2023-11-30 03:36:08,352 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:36:08,352 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 78 treesize of output 70 [2023-11-30 03:36:08,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-30 03:36:08,951 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:36:08,952 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 85 treesize of output 75 [2023-11-30 03:36:08,959 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-30 03:36:09,399 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-30 03:36:09,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:36:09,833 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 26 treesize of output 28 [2023-11-30 03:36:09,938 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 33 treesize of output 38 [2023-11-30 03:36:10,108 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 03:36:10,109 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 60 treesize of output 32 [2023-11-30 03:36:10,116 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 7 treesize of output 3 [2023-11-30 03:36:10,182 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-30 03:36:10,208 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-30 03:36:10,238 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-30 03:36:10,261 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-30 03:36:10,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:36:10,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:36:10,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:36:10,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:36:10,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:36:10,392 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 52 treesize of output 41 [2023-11-30 03:36:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:36:10,441 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:36:10,579 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false [2023-11-30 03:36:10,666 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse0) (forall ((v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse3) v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse0) (forall ((v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse3) v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (or (forall ((v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse3) v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse0) (forall ((v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse3) v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false [2023-11-30 03:36:30,295 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse7 0))) (.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_27| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (or (forall ((v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_27| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse5) (forall ((v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (or (forall ((v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse5))) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse5) (forall ((v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int))) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse0)))))) is different from false [2023-11-30 03:36:30,456 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse6 0))) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (or (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse4) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int) (v_ArrVal_1045 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (or (= (select (select (let ((.cse9 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1043))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1045))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_24| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse4)))))) is different from false [2023-11-30 03:36:39,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:36:39,801 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 81 treesize of output 74 [2023-11-30 03:36:39,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:36:39,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 340 treesize of output 326 [2023-11-30 03:36:39,840 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 194 treesize of output 178 [2023-11-30 03:36:39,877 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 31 treesize of output 17 [2023-11-30 03:36:39,888 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 152 treesize of output 130 [2023-11-30 03:36:40,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:36:40,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-30 03:36:40,247 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:36:40,260 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-30 03:36:40,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130 [2023-11-30 03:36:40,273 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 48 treesize of output 44 [2023-11-30 03:36:40,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 80 treesize of output 62 [2023-11-30 03:36:40,310 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:36:40,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2023-11-30 03:36:40,325 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:36:40,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-30 03:36:42,462 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1030 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1030) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_1031 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1030))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1033 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1031))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_1033) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_1032 (Array Int Int))) (not (= (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse2 .cse1 v_ArrVal_1032) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))))) is different from false [2023-11-30 03:36:42,522 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1030 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1030) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1031 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1030))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1033 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1031))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_1033) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_1032 (Array Int Int))) (not (= (select (select (store .cse3 .cse2 v_ArrVal_1032) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) is different from false [2023-11-30 03:36:42,570 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 279 treesize of output 259 [2023-11-30 03:36:42,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 66 treesize of output 62 [2023-11-30 03:36:42,582 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 31 treesize of output 29 [2023-11-30 03:36:43,049 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-30 03:36:43,050 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 804 treesize of output 527 [2023-11-30 03:36:43,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:36:43,062 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 99 treesize of output 97 [2023-11-30 03:36:43,067 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 70 treesize of output 62 [2023-11-30 03:36:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:36:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436168432] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:36:47,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:36:47,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 24] total 72 [2023-11-30 03:36:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569672007] [2023-11-30 03:36:47,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:36:47,489 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-11-30 03:36:47,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:36:47,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-11-30 03:36:47,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=4059, Unknown=81, NotChecked=810, Total=5256 [2023-11-30 03:36:47,493 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:36:47,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 1384 transitions, 25329 flow. Second operand has 73 states, 73 states have (on average 40.45205479452055) internal successors, (2953), 73 states have internal predecessors, (2953), 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-30 03:36:47,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:36:47,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:36:47,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:37:05,575 INFO L124 PetriNetUnfolderBase]: 1198/4482 cut-off events. [2023-11-30 03:37:05,575 INFO L125 PetriNetUnfolderBase]: For 12527/12547 co-relation queries the response was YES. [2023-11-30 03:37:05,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34019 conditions, 4482 events. 1198/4482 cut-off events. For 12527/12547 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 38953 event pairs, 35 based on Foata normal form. 6/4385 useless extension candidates. Maximal degree in co-relation 31351. Up to 2476 conditions per place. [2023-11-30 03:37:05,601 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 941 selfloop transitions, 288 changer transitions 525/1776 dead transitions. [2023-11-30 03:37:05,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 1776 transitions, 35970 flow [2023-11-30 03:37:05,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-30 03:37:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-11-30 03:37:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 2081 transitions. [2023-11-30 03:37:05,605 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3400326797385621 [2023-11-30 03:37:05,605 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 2081 transitions. [2023-11-30 03:37:05,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 2081 transitions. [2023-11-30 03:37:05,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:37:05,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 2081 transitions. [2023-11-30 03:37:05,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 46.24444444444445) internal successors, (2081), 45 states have internal predecessors, (2081), 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-30 03:37:05,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 136.0) internal successors, (6256), 46 states have internal predecessors, (6256), 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-30 03:37:05,617 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 136.0) internal successors, (6256), 46 states have internal predecessors, (6256), 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-30 03:37:05,617 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 236 predicate places. [2023-11-30 03:37:05,617 INFO L500 AbstractCegarLoop]: Abstraction has has 371 places, 1776 transitions, 35970 flow [2023-11-30 03:37:05,618 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 40.45205479452055) internal successors, (2953), 73 states have internal predecessors, (2953), 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-30 03:37:05,618 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:37:05,618 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:37:05,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-30 03:37:05,824 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-30 03:37:05,824 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:37:05,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:37:05,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1023301641, now seen corresponding path program 6 times [2023-11-30 03:37:05,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:37:05,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582821432] [2023-11-30 03:37:05,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:37:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:37:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:37:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:37:09,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:37:09,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582821432] [2023-11-30 03:37:09,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582821432] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:37:09,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772894934] [2023-11-30 03:37:09,608 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-30 03:37:09,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:37:09,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:37:09,612 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:37:09,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-30 03:37:09,790 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-30 03:37:09,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:37:09,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-30 03:37:09,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:37:10,346 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:37:10,347 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 69 treesize of output 65 [2023-11-30 03:37:10,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:10,352 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 24 treesize of output 11 [2023-11-30 03:37:10,978 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:37:10,978 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 76 treesize of output 70 [2023-11-30 03:37:10,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:10,988 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 24 treesize of output 11 [2023-11-30 03:37:11,483 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-30 03:37:11,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:37:11,987 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 26 treesize of output 28 [2023-11-30 03:37:12,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:37:12,099 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 35 [2023-11-30 03:37:12,113 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-30 03:37:12,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:12,185 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 30 treesize of output 21 [2023-11-30 03:37:12,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:12,207 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 30 treesize of output 21 [2023-11-30 03:37:12,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:12,226 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 30 treesize of output 21 [2023-11-30 03:37:12,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:12,244 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 30 treesize of output 21 [2023-11-30 03:37:12,330 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 33 treesize of output 38 [2023-11-30 03:37:12,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:12,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:12,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:12,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:12,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:37:12,439 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 52 treesize of output 41 [2023-11-30 03:37:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:37:12,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:37:12,817 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1212 Int)) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1212 Int)) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1212 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1212 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false [2023-11-30 03:37:13,973 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1212 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse6))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1212 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse6))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1212 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse6))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1212 Int)) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse6)))))) is different from false [2023-11-30 03:37:16,094 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1212 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse6))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1212 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse6))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1212 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse6))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1212 Int)) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse6)))))))) is different from false [2023-11-30 03:37:16,162 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int) (v_ArrVal_1210 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1212 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int) (v_ArrVal_1210 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1212 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int) (v_ArrVal_1210 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1212 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int) (v_ArrVal_1210 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1212 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5)))))) is different from false [2023-11-30 03:37:16,270 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0) .cse4 0))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int) (v_ArrVal_1210 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1212 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_29| .cse5) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int) (v_ArrVal_1210 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1212 Int)) (or (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_29| .cse5) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int) (v_ArrVal_1210 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1212 Int)) (or (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0) (< |v_ULTIMATE.start_main_~i~1#1_29| .cse5) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int) (v_ArrVal_1210 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int) (v_ArrVal_1212 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse5) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1212))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse6)))))) is different from false [2023-11-30 03:37:16,321 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-30 03:37:16,322 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 746 treesize of output 568 [2023-11-30 03:37:16,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:37:16,341 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 244 treesize of output 240 [2023-11-30 03:37:16,350 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 226 treesize of output 210 [2023-11-30 03:37:16,455 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:37:16,463 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-30 03:37:16,463 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 746 treesize of output 1 [2023-11-30 03:37:16,468 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:37:16,486 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-30 03:37:16,486 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 498 treesize of output 437 [2023-11-30 03:37:16,491 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:37:16,493 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 79 treesize of output 73 [2023-11-30 03:37:16,514 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:37:16,523 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-30 03:37:16,523 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 714 treesize of output 1 [2023-11-30 03:37:17,328 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1198))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1201 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1199))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_1201) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_1200 (Array Int Int))) (not (= (select (select (store .cse2 .cse1 v_ArrVal_1200) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (forall ((v_ArrVal_1198 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1198) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-30 03:37:17,381 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1198))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1200 (Array Int Int))) (not (= (select (select (store .cse0 .cse1 v_ArrVal_1200) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1201 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1199))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_1201) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_1198 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1198) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false [2023-11-30 03:37:17,428 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 279 treesize of output 259 [2023-11-30 03:37:17,442 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 33 treesize of output 31 [2023-11-30 03:37:17,447 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 64 treesize of output 60 [2023-11-30 03:37:17,952 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-30 03:37:17,953 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 618 treesize of output 389 [2023-11-30 03:37:17,962 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 73 treesize of output 65 [2023-11-30 03:37:17,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:37:17,974 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 86 treesize of output 84 [2023-11-30 03:37:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:37:18,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772894934] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:37:18,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:37:18,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 71 [2023-11-30 03:37:18,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819872348] [2023-11-30 03:37:18,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:37:18,228 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-30 03:37:18,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:37:18,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-30 03:37:18,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3892, Unknown=24, NotChecked=924, Total=5112 [2023-11-30 03:37:18,232 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:37:18,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 1776 transitions, 35970 flow. Second operand has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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-30 03:37:18,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:37:18,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:37:18,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:37:33,212 INFO L124 PetriNetUnfolderBase]: 1258/4710 cut-off events. [2023-11-30 03:37:33,212 INFO L125 PetriNetUnfolderBase]: For 15816/15838 co-relation queries the response was YES. [2023-11-30 03:37:33,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39332 conditions, 4710 events. 1258/4710 cut-off events. For 15816/15838 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 41718 event pairs, 36 based on Foata normal form. 6/4610 useless extension candidates. Maximal degree in co-relation 36413. Up to 2622 conditions per place. [2023-11-30 03:37:33,239 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 1037 selfloop transitions, 316 changer transitions 525/1900 dead transitions. [2023-11-30 03:37:33,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 1900 transitions, 42346 flow [2023-11-30 03:37:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-30 03:37:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-11-30 03:37:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 2062 transitions. [2023-11-30 03:37:33,250 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3445855614973262 [2023-11-30 03:37:33,250 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 2062 transitions. [2023-11-30 03:37:33,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 2062 transitions. [2023-11-30 03:37:33,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:37:33,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 2062 transitions. [2023-11-30 03:37:33,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 46.86363636363637) internal successors, (2062), 44 states have internal predecessors, (2062), 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-30 03:37:33,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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-30 03:37:33,265 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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-30 03:37:33,265 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 279 predicate places. [2023-11-30 03:37:33,266 INFO L500 AbstractCegarLoop]: Abstraction has has 414 places, 1900 transitions, 42346 flow [2023-11-30 03:37:33,267 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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-30 03:37:33,267 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:37:33,267 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:37:33,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-30 03:37:33,472 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:37:33,472 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:37:33,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:37:33,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1330435177, now seen corresponding path program 7 times [2023-11-30 03:37:33,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:37:33,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167154091] [2023-11-30 03:37:33,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:37:33,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:37:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:37:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:37:35,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:37:35,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167154091] [2023-11-30 03:37:35,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167154091] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:37:35,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919028276] [2023-11-30 03:37:35,693 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-30 03:37:35,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:37:35,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:37:35,694 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:37:35,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-30 03:37:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:37:35,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-30 03:37:35,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:37:35,856 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-30 03:37:35,878 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-30 03:37:35,878 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 21 treesize of output 29 [2023-11-30 03:37:35,932 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-30 03:37:35,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-30 03:37:36,213 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:37:36,213 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 70 treesize of output 64 [2023-11-30 03:37:36,223 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 24 treesize of output 11 [2023-11-30 03:37:36,817 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-30 03:37:36,818 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 77 treesize of output 73 [2023-11-30 03:37:36,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 20 treesize of output 11 [2023-11-30 03:37:36,874 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 22 treesize of output 16 [2023-11-30 03:37:37,223 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-30 03:37:37,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:37:37,438 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 26 treesize of output 28 [2023-11-30 03:37:37,582 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 33 treesize of output 38 [2023-11-30 03:37:37,707 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-30 03:37:37,710 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-30 03:37:37,787 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-30 03:37:37,810 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-30 03:37:37,831 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-30 03:37:37,848 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-30 03:37:37,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:37,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:37,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:37,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:37,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:37:37,970 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 52 treesize of output 41 [2023-11-30 03:37:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:37:38,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:37:38,863 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse3) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (forall ((v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse3) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse3) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse3) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) is different from false [2023-11-30 03:37:57,773 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) (.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5)))))) is different from false [2023-11-30 03:37:59,845 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse4 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0) .cse9 0)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_31| .cse4) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_31| .cse4) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_31| .cse4) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0))))))))) is different from false [2023-11-30 03:38:00,070 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0) .cse9 0))) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse4))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse4))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse4))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse4)))))) is different from false [2023-11-30 03:38:00,839 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0) .cse10 0) .cse8 0))) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse1) (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse1))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1382 Int) (v_ArrVal_1381 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (= (select (select (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1381))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1382))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse1)))))) is different from false [2023-11-30 03:38:00,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:38:00,869 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 79 treesize of output 72 [2023-11-30 03:38:00,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:38:00,882 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 412 treesize of output 384 [2023-11-30 03:38:00,896 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 170 treesize of output 162 [2023-11-30 03:38:00,928 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 31 treesize of output 17 [2023-11-30 03:38:00,939 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 137 treesize of output 119 [2023-11-30 03:38:01,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:38:01,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-30 03:38:01,099 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:38:01,115 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-30 03:38:01,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130 [2023-11-30 03:38:01,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 48 treesize of output 44 [2023-11-30 03:38:01,137 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 80 treesize of output 62 [2023-11-30 03:38:01,167 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:38:01,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-30 03:38:01,177 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:38:01,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-30 03:38:04,223 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1368 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1368))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1371 (Array Int Int))) (not (= (select (select (store .cse0 .cse1 v_ArrVal_1371) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1370 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1369))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_1370) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_1368 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1368) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-30 03:38:04,308 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1368 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1368) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1368 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1368))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1371 (Array Int Int))) (not (= (select (select (store .cse1 .cse2 v_ArrVal_1371) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1370 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1369))) (< (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse3 .cse2 v_ArrVal_1370) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))))) is different from false [2023-11-30 03:38:04,362 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 279 treesize of output 259 [2023-11-30 03:38:04,370 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 122 treesize of output 120 [2023-11-30 03:38:04,375 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 120 treesize of output 116 [2023-11-30 03:38:05,107 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-30 03:38:05,107 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 717 treesize of output 452 [2023-11-30 03:38:05,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:38:05,122 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 133 treesize of output 127 [2023-11-30 03:38:05,128 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 100 treesize of output 94 [2023-11-30 03:38:05,279 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-30 03:38:05,279 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 22 treesize of output 18 [2023-11-30 03:38:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:38:05,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919028276] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:38:05,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:38:05,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 24] total 69 [2023-11-30 03:38:05,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52237462] [2023-11-30 03:38:05,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:38:05,343 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-11-30 03:38:05,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:38:05,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-11-30 03:38:05,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3639, Unknown=53, NotChecked=896, Total=4830 [2023-11-30 03:38:05,347 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:38:05,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 1900 transitions, 42346 flow. Second operand has 70 states, 70 states have (on average 40.5) internal successors, (2835), 70 states have internal predecessors, (2835), 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-30 03:38:05,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:38:05,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:38:05,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:38:21,015 INFO L124 PetriNetUnfolderBase]: 1403/5925 cut-off events. [2023-11-30 03:38:21,016 INFO L125 PetriNetUnfolderBase]: For 24824/24848 co-relation queries the response was YES. [2023-11-30 03:38:21,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52758 conditions, 5925 events. 1403/5925 cut-off events. For 24824/24848 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 57956 event pairs, 49 based on Foata normal form. 6/5804 useless extension candidates. Maximal degree in co-relation 47585. Up to 3239 conditions per place. [2023-11-30 03:38:21,046 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 1210 selfloop transitions, 365 changer transitions 814/2411 dead transitions. [2023-11-30 03:38:21,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 2411 transitions, 58419 flow [2023-11-30 03:38:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-30 03:38:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-11-30 03:38:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2176 transitions. [2023-11-30 03:38:21,050 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3404255319148936 [2023-11-30 03:38:21,050 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 2176 transitions. [2023-11-30 03:38:21,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 2176 transitions. [2023-11-30 03:38:21,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:38:21,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 2176 transitions. [2023-11-30 03:38:21,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 46.297872340425535) internal successors, (2176), 47 states have internal predecessors, (2176), 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-30 03:38:21,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 136.0) internal successors, (6528), 48 states have internal predecessors, (6528), 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-30 03:38:21,061 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 136.0) internal successors, (6528), 48 states have internal predecessors, (6528), 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-30 03:38:21,061 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 325 predicate places. [2023-11-30 03:38:21,062 INFO L500 AbstractCegarLoop]: Abstraction has has 460 places, 2411 transitions, 58419 flow [2023-11-30 03:38:21,062 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 40.5) internal successors, (2835), 70 states have internal predecessors, (2835), 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-30 03:38:21,062 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:38:21,063 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:38:21,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-30 03:38:21,268 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:38:21,269 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:38:21,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:38:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1355878203, now seen corresponding path program 8 times [2023-11-30 03:38:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:38:21,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070915933] [2023-11-30 03:38:21,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:38:21,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:38:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:38:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:38:22,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:38:22,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070915933] [2023-11-30 03:38:22,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070915933] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:38:22,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837341314] [2023-11-30 03:38:22,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 03:38:22,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:38:22,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:38:22,961 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:38:22,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-30 03:38:23,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 03:38:23,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:38:23,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-30 03:38:23,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:38:23,818 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:38:23,819 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 69 treesize of output 65 [2023-11-30 03:38:23,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:23,826 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 24 treesize of output 11 [2023-11-30 03:38:24,616 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:38:24,617 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 76 treesize of output 70 [2023-11-30 03:38:24,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:24,627 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 24 treesize of output 11 [2023-11-30 03:38:25,097 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-30 03:38:25,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:38:25,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:38:25,691 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 35 [2023-11-30 03:38:25,703 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-30 03:38:25,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:25,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:38:25,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:25,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:38:25,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:25,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:38:25,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:25,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:38:25,890 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 26 treesize of output 28 [2023-11-30 03:38:25,969 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 33 treesize of output 38 [2023-11-30 03:38:26,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:26,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:26,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:26,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:26,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:38:26,126 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 52 treesize of output 41 [2023-11-30 03:38:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:38:26,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:38:26,901 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int)) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int)) (= 0 (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse9 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse9 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))))) is different from false [2023-11-30 03:38:27,059 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int)) (= (select (select (let ((.cse0 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse5 0))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse2) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse6))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse6) (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse5 0))))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse2) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse6) (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse5 0))))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse2) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse6) (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse5 0))))) (store .cse11 .cse1 (store (select .cse11 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse2) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) is different from false [2023-11-30 03:38:29,175 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int)) (= (select (select (let ((.cse2 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse11 .cse3 (store (select .cse11 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1))))))) is different from false [2023-11-30 03:38:29,279 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse6))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse6) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse6) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (= (select (select (let ((.cse11 (let ((.cse12 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse11 .cse1 (store (select .cse11 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse5) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse6))))) is different from false [2023-11-30 03:38:29,430 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse1) (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse1) (= 0 (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) .cse8)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse1))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1551 Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse1) (= (select (select (let ((.cse10 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1546) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse10 .cse3 (store (select .cse10 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1551))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))))) is different from false [2023-11-30 03:38:29,475 INFO L349 Elim1Store]: treesize reduction 26, result has 63.9 percent of original size [2023-11-30 03:38:29,476 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 706 treesize of output 583 [2023-11-30 03:38:29,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:38:29,497 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 259 treesize of output 255 [2023-11-30 03:38:29,507 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 226 treesize of output 210 [2023-11-30 03:38:29,588 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:38:29,610 INFO L349 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2023-11-30 03:38:29,611 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 498 treesize of output 452 [2023-11-30 03:38:29,618 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:38:29,620 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 84 treesize of output 78 [2023-11-30 03:38:29,639 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:38:29,665 INFO L349 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2023-11-30 03:38:29,665 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 498 treesize of output 452 [2023-11-30 03:38:29,678 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:38:29,681 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 84 treesize of output 78 [2023-11-30 03:38:29,708 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:38:29,717 INFO L349 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2023-11-30 03:38:29,717 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 674 treesize of output 1 [2023-11-30 03:38:30,616 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1537 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1537) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1537 (Array Int Int)) (v_ArrVal_1536 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1537))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1538 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1536))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_1538) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_1539 (Array Int Int))) (not (= (select (select (store .cse2 .cse1 v_ArrVal_1539) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))))) is different from false [2023-11-30 03:38:30,694 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1537 (Array Int Int)) (v_ArrVal_1536 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1537))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1538 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1536))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_1538) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_1539 (Array Int Int))) (not (= (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse3 .cse1 v_ArrVal_1539) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (forall ((v_ArrVal_1537 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1537) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))))) is different from false [2023-11-30 03:38:30,738 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 279 treesize of output 259 [2023-11-30 03:38:30,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2023-11-30 03:38:30,749 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 31 treesize of output 29 [2023-11-30 03:38:31,125 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-30 03:38:31,126 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 416 treesize of output 267 [2023-11-30 03:38:31,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:38:31,142 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 85 treesize of output 85 [2023-11-30 03:38:31,149 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 54 [2023-11-30 03:38:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:38:31,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837341314] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:38:31,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:38:31,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 70 [2023-11-30 03:38:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467106239] [2023-11-30 03:38:31,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:38:31,317 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-30 03:38:31,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:38:31,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-30 03:38:31,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=3725, Unknown=42, NotChecked=910, Total=4970 [2023-11-30 03:38:31,321 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:38:31,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 2411 transitions, 58419 flow. Second operand has 71 states, 71 states have (on average 40.521126760563384) internal successors, (2877), 71 states have internal predecessors, (2877), 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-30 03:38:31,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:38:31,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:38:31,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:38:46,221 INFO L124 PetriNetUnfolderBase]: 1527/6681 cut-off events. [2023-11-30 03:38:46,221 INFO L125 PetriNetUnfolderBase]: For 31963/31995 co-relation queries the response was YES. [2023-11-30 03:38:46,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63101 conditions, 6681 events. 1527/6681 cut-off events. For 31963/31995 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 67868 event pairs, 63 based on Foata normal form. 10/6529 useless extension candidates. Maximal degree in co-relation 56660. Up to 3571 conditions per place. [2023-11-30 03:38:46,257 INFO L140 encePairwiseOnDemand]: 102/136 looper letters, 1428 selfloop transitions, 436 changer transitions 876/2762 dead transitions. [2023-11-30 03:38:46,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 2762 transitions, 72707 flow [2023-11-30 03:38:46,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-30 03:38:46,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-11-30 03:38:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 2019 transitions. [2023-11-30 03:38:46,263 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.34524623803009574 [2023-11-30 03:38:46,263 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 2019 transitions. [2023-11-30 03:38:46,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 2019 transitions. [2023-11-30 03:38:46,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:38:46,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 2019 transitions. [2023-11-30 03:38:46,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 46.95348837209303) internal successors, (2019), 43 states have internal predecessors, (2019), 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-30 03:38:46,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 136.0) internal successors, (5984), 44 states have internal predecessors, (5984), 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-30 03:38:46,272 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 136.0) internal successors, (5984), 44 states have internal predecessors, (5984), 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-30 03:38:46,272 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 367 predicate places. [2023-11-30 03:38:46,273 INFO L500 AbstractCegarLoop]: Abstraction has has 502 places, 2762 transitions, 72707 flow [2023-11-30 03:38:46,273 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 40.521126760563384) internal successors, (2877), 71 states have internal predecessors, (2877), 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-30 03:38:46,273 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:38:46,273 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:38:46,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-30 03:38:46,480 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-30 03:38:46,481 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:38:46,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:38:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash 516507679, now seen corresponding path program 9 times [2023-11-30 03:38:46,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:38:46,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316210254] [2023-11-30 03:38:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:38:46,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:38:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:38:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:38:50,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:38:50,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316210254] [2023-11-30 03:38:50,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316210254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:38:50,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367065636] [2023-11-30 03:38:50,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 03:38:50,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:38:50,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:38:50,533 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:38:50,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-30 03:38:50,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-30 03:38:50,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:38:50,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-30 03:38:50,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:38:51,076 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-30 03:38:51,077 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-30 03:38:51,474 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:38:51,475 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 76 treesize of output 70 [2023-11-30 03:38:51,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:51,483 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 24 treesize of output 11 [2023-11-30 03:38:51,874 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-30 03:38:51,974 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-30 03:38:52,206 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-30 03:38:52,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-30 03:38:52,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:38:52,490 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-30 03:38:52,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:52,571 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-30 03:38:52,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:52,593 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-30 03:38:52,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:52,608 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-30 03:38:52,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:52,632 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-30 03:38:52,724 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-30 03:38:52,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:52,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:52,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:52,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:38:52,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:38:52,852 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 58 treesize of output 47 [2023-11-30 03:38:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:38:52,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:38:53,289 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= 0 (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)))) is different from false [2023-11-30 03:38:53,396 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse2) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse2) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse2) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse5) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse2) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false [2023-11-30 03:38:55,482 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse4) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse5))))) is different from false [2023-11-30 03:38:57,530 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse0) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse0) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= 0 (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse4))))) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse0) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse0) (forall ((v_ArrVal_1718 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse5)))))) is different from false [2023-11-30 03:38:57,590 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse6))) (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse6) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))) (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse6))) (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (= 0 (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse4)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse6)))))) is different from false [2023-11-30 03:38:57,691 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0) .cse10 0))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1) (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))) (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0))) (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((v_ArrVal_1718 Int) (|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1718))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1)))))) is different from false [2023-11-30 03:38:57,728 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-30 03:38:57,728 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 348 treesize of output 284 [2023-11-30 03:38:57,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:38:57,741 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 228 treesize of output 224 [2023-11-30 03:38:57,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 206 treesize of output 198 [2023-11-30 03:38:57,872 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:38:57,892 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-30 03:38:57,892 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 364 treesize of output 273 [2023-11-30 03:38:57,896 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:38:57,898 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 133 treesize of output 123 [2023-11-30 03:38:57,931 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:38:57,948 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-30 03:38:57,949 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 240 treesize of output 221 [2023-11-30 03:38:57,953 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:38:57,955 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 97 treesize of output 91 [2023-11-30 03:38:57,980 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:38:57,988 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-30 03:38:57,988 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 364 treesize of output 1 [2023-11-30 03:38:58,511 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 70 treesize of output 62 [2023-11-30 03:38:58,722 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1704 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1704) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_1704 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1704))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1706 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_1706) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (not (= .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|))))))) is different from false [2023-11-30 03:38:58,791 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_38| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_38|) (forall ((v_ArrVal_1704 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_38| v_ArrVal_1704) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_38| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_38|) (forall ((v_ArrVal_1704 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_38| v_ArrVal_1704))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|)) (forall ((v_ArrVal_1706 (Array Int Int))) (not (= (select (select (store .cse2 .cse1 v_ArrVal_1706) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))))) is different from false [2023-11-30 03:38:59,181 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 20 treesize of output 18 [2023-11-30 03:38:59,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:38:59,298 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-30 03:38:59,305 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 33 treesize of output 27 [2023-11-30 03:38:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:38:59,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367065636] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:38:59,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:38:59,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 24] total 68 [2023-11-30 03:38:59,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401870534] [2023-11-30 03:38:59,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:38:59,425 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-30 03:38:59,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:38:59,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-30 03:38:59,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=3454, Unknown=13, NotChecked=1000, Total=4692 [2023-11-30 03:38:59,429 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:38:59,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 2762 transitions, 72707 flow. Second operand has 69 states, 69 states have (on average 40.56521739130435) internal successors, (2799), 69 states have internal predecessors, (2799), 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-30 03:38:59,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:38:59,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:38:59,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:39:14,567 INFO L124 PetriNetUnfolderBase]: 1543/6802 cut-off events. [2023-11-30 03:39:14,567 INFO L125 PetriNetUnfolderBase]: For 37769/37797 co-relation queries the response was YES. [2023-11-30 03:39:14,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68886 conditions, 6802 events. 1543/6802 cut-off events. For 37769/37797 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 69595 event pairs, 64 based on Foata normal form. 6/6656 useless extension candidates. Maximal degree in co-relation 61978. Up to 3647 conditions per place. [2023-11-30 03:39:14,607 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 1537 selfloop transitions, 426 changer transitions 876/2861 dead transitions. [2023-11-30 03:39:14,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 2861 transitions, 81043 flow [2023-11-30 03:39:14,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-30 03:39:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-11-30 03:39:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 2101 transitions. [2023-11-30 03:39:14,610 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3358375959079284 [2023-11-30 03:39:14,610 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 2101 transitions. [2023-11-30 03:39:14,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 2101 transitions. [2023-11-30 03:39:14,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:39:14,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 2101 transitions. [2023-11-30 03:39:14,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 45.67391304347826) internal successors, (2101), 46 states have internal predecessors, (2101), 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-30 03:39:14,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 136.0) internal successors, (6392), 47 states have internal predecessors, (6392), 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-30 03:39:14,619 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 136.0) internal successors, (6392), 47 states have internal predecessors, (6392), 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-30 03:39:14,620 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 412 predicate places. [2023-11-30 03:39:14,620 INFO L500 AbstractCegarLoop]: Abstraction has has 547 places, 2861 transitions, 81043 flow [2023-11-30 03:39:14,620 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 40.56521739130435) internal successors, (2799), 69 states have internal predecessors, (2799), 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-30 03:39:14,621 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:39:14,621 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:39:14,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-30 03:39:14,827 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-30 03:39:14,827 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:39:14,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:39:14,827 INFO L85 PathProgramCache]: Analyzing trace with hash 955076655, now seen corresponding path program 10 times [2023-11-30 03:39:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:39:14,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667114262] [2023-11-30 03:39:14,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:39:14,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:39:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:39:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:39:16,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:39:16,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667114262] [2023-11-30 03:39:16,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667114262] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:39:16,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953799506] [2023-11-30 03:39:16,201 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-30 03:39:16,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:39:16,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:39:16,216 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:39:16,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-30 03:39:16,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-30 03:39:16,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:39:16,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-30 03:39:16,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:39:17,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:39:17,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 03:39:17,328 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-30 03:39:17,329 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-30 03:39:17,979 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-30 03:39:17,979 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-30 03:39:17,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:39:17,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 03:39:18,365 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-30 03:39:18,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:39:18,752 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 26 treesize of output 28 [2023-11-30 03:39:18,860 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 33 treesize of output 38 [2023-11-30 03:39:19,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:39:19,040 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 35 [2023-11-30 03:39:19,053 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-30 03:39:19,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:39:19,114 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-30 03:39:19,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:39:19,139 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-30 03:39:19,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:39:19,160 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-30 03:39:19,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:39:19,177 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-30 03:39:19,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:39:19,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:39:19,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:39:19,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:39:19,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:39:19,284 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 52 treesize of output 41 [2023-11-30 03:39:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:39:19,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:39:19,477 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) is different from false [2023-11-30 03:39:19,605 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3))))) is different from false [2023-11-30 03:39:21,694 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4)))))) is different from false [2023-11-30 03:39:32,370 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse6 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4)))))))) is different from false [2023-11-30 03:39:34,078 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0) .cse7 0) .cse4 0))) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1884 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5)))))))) is different from false [2023-11-30 03:39:36,160 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0) .cse6 0) .cse8 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1884 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1884 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1884 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1884 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1884))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse4)))))) is different from false [2023-11-30 03:39:36,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:39:36,251 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 81 treesize of output 74 [2023-11-30 03:39:36,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:39:36,261 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 352 treesize of output 326 [2023-11-30 03:39:36,270 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 177 [2023-11-30 03:39:36,300 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 31 treesize of output 17 [2023-11-30 03:39:36,309 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 149 treesize of output 127 [2023-11-30 03:39:36,435 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:39:36,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-30 03:39:36,443 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:39:36,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2023-11-30 03:39:36,452 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:39:36,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-30 03:39:38,664 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1872 (Array Int Int)) (v_ArrVal_1871 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_25| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1872))) (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~mem12#1.base_25|) (forall ((v_ArrVal_1874 (Array Int Int))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_25| v_ArrVal_1874) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1873 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1871))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_25| v_ArrVal_1873) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))) (forall ((v_ArrVal_1872 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1872) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-30 03:39:41,214 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 197 treesize of output 177 [2023-11-30 03:39:41,280 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 18 treesize of output 16 [2023-11-30 03:39:41,285 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 34 treesize of output 30 [2023-11-30 03:39:41,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 13 treesize of output 11 [2023-11-30 03:39:41,660 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-30 03:39:41,660 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 45 treesize of output 36 [2023-11-30 03:39:41,664 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 11 treesize of output 9 [2023-11-30 03:39:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:39:41,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953799506] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:39:41,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:39:41,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 71 [2023-11-30 03:39:41,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249086842] [2023-11-30 03:39:41,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:39:41,807 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-30 03:39:41,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:39:41,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-30 03:39:41,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=3867, Unknown=35, NotChecked=924, Total=5112 [2023-11-30 03:39:41,810 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:39:41,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 2861 transitions, 81043 flow. Second operand has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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-30 03:39:41,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:39:41,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:39:41,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:39:58,170 INFO L124 PetriNetUnfolderBase]: 1723/7860 cut-off events. [2023-11-30 03:39:58,170 INFO L125 PetriNetUnfolderBase]: For 50621/50651 co-relation queries the response was YES. [2023-11-30 03:39:58,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85347 conditions, 7860 events. 1723/7860 cut-off events. For 50621/50651 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 83519 event pairs, 65 based on Foata normal form. 6/7686 useless extension candidates. Maximal degree in co-relation 75998. Up to 4281 conditions per place. [2023-11-30 03:39:58,221 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 1741 selfloop transitions, 510 changer transitions 1066/3339 dead transitions. [2023-11-30 03:39:58,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 3339 transitions, 101057 flow [2023-11-30 03:39:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-30 03:39:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-11-30 03:39:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2193 transitions. [2023-11-30 03:39:58,225 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.34308510638297873 [2023-11-30 03:39:58,225 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 2193 transitions. [2023-11-30 03:39:58,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 2193 transitions. [2023-11-30 03:39:58,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:39:58,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 2193 transitions. [2023-11-30 03:39:58,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 46.659574468085104) internal successors, (2193), 47 states have internal predecessors, (2193), 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-30 03:39:58,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 136.0) internal successors, (6528), 48 states have internal predecessors, (6528), 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-30 03:39:58,236 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 136.0) internal successors, (6528), 48 states have internal predecessors, (6528), 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-30 03:39:58,236 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 458 predicate places. [2023-11-30 03:39:58,236 INFO L500 AbstractCegarLoop]: Abstraction has has 593 places, 3339 transitions, 101057 flow [2023-11-30 03:39:58,237 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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-30 03:39:58,237 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:39:58,237 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:39:58,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-30 03:39:58,444 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-30 03:39:58,444 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:39:58,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:39:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1122537265, now seen corresponding path program 11 times [2023-11-30 03:39:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:39:58,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147466651] [2023-11-30 03:39:58,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:39:58,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:39:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:40:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:40:00,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:40:00,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147466651] [2023-11-30 03:40:00,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147466651] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:40:00,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651801977] [2023-11-30 03:40:00,354 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-30 03:40:00,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:40:00,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:40:00,355 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:40:00,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-30 03:40:00,694 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 03:40:00,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:40:00,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-30 03:40:00,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:40:00,705 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-30 03:40:00,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:00,744 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 12 treesize of output 14 [2023-11-30 03:40:00,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:00,852 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-11-30 03:40:00,852 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 26 treesize of output 41 [2023-11-30 03:40:00,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:00,948 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2023-11-30 03:40:00,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2023-11-30 03:40:01,367 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:40:01,367 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 78 treesize of output 70 [2023-11-30 03:40:01,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-30 03:40:02,014 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:40:02,014 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 85 treesize of output 75 [2023-11-30 03:40:02,023 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-30 03:40:02,491 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-30 03:40:02,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:40:02,858 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 26 treesize of output 28 [2023-11-30 03:40:03,096 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 33 treesize of output 38 [2023-11-30 03:40:03,271 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 03:40:03,271 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 60 treesize of output 32 [2023-11-30 03:40:03,297 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 7 treesize of output 3 [2023-11-30 03:40:03,374 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-30 03:40:03,388 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-30 03:40:03,409 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-30 03:40:03,431 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-30 03:40:03,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:03,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:03,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:03,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:03,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:40:03,540 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 52 treesize of output 41 [2023-11-30 03:40:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:40:03,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:40:03,797 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) is different from false [2023-11-30 03:40:03,852 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse2) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3) (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse2) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse2) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse2) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3))))) is different from false [2023-11-30 03:40:05,930 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse2) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse2) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse2) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse2) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse5)))))) is different from false [2023-11-30 03:40:07,984 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3) (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse4)))))) is different from false [2023-11-30 03:40:10,034 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse8 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse4) (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse9 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse4)))))))) is different from false [2023-11-30 03:40:11,716 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse7 0) .cse9 0)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse4) (forall ((v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (= (select (select (let ((.cse10 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))))))) is different from false [2023-11-30 03:40:11,916 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0) .cse9 0) .cse5 0))) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2057 Int) (v_ArrVal_2055 (Array Int Int))) (or (= (select (select (let ((.cse10 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2055))) (store .cse10 .cse3 (store (select .cse10 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2057))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1)))))) is different from false [2023-11-30 03:40:12,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:40:12,013 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 81 treesize of output 74 [2023-11-30 03:40:12,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:40:12,023 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 444 treesize of output 416 [2023-11-30 03:40:12,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 190 treesize of output 174 [2023-11-30 03:40:12,058 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 31 treesize of output 17 [2023-11-30 03:40:12,069 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 149 treesize of output 127 [2023-11-30 03:40:12,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:40:12,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-30 03:40:12,280 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:40:12,296 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-30 03:40:12,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130 [2023-11-30 03:40:12,309 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 48 treesize of output 44 [2023-11-30 03:40:12,319 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 80 treesize of output 62 [2023-11-30 03:40:12,346 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:40:12,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-30 03:40:12,355 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:40:12,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2023-11-30 03:40:13,007 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2043 (Array Int Int)) (v_ArrVal_2042 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2043))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2044 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_2044) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2045 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2042))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_2045) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_2043 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2043) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false [2023-11-30 03:40:13,083 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_2043 (Array Int Int)) (v_ArrVal_2042 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2043))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2044 (Array Int Int))) (not (= (select (select (store .cse0 .cse1 v_ArrVal_2044) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2045 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_2042))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_2045) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_2043 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2043) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false [2023-11-30 03:40:13,129 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 279 treesize of output 259 [2023-11-30 03:40:13,140 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 66 treesize of output 62 [2023-11-30 03:40:13,147 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 31 treesize of output 29 [2023-11-30 03:40:13,510 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-30 03:40:13,511 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 804 treesize of output 527 [2023-11-30 03:40:13,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:40:13,524 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 94 treesize of output 92 [2023-11-30 03:40:13,529 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 57 [2023-11-30 03:40:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:40:17,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651801977] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:40:17,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:40:17,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 71 [2023-11-30 03:40:17,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102800964] [2023-11-30 03:40:17,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:40:17,804 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-30 03:40:17,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:40:17,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-30 03:40:17,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=3659, Unknown=14, NotChecked=1170, Total=5112 [2023-11-30 03:40:17,807 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:40:17,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 3339 transitions, 101057 flow. Second operand has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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-30 03:40:17,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:40:17,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:40:17,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:40:33,608 INFO L124 PetriNetUnfolderBase]: 1878/8742 cut-off events. [2023-11-30 03:40:33,608 INFO L125 PetriNetUnfolderBase]: For 67401/67429 co-relation queries the response was YES. [2023-11-30 03:40:33,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100712 conditions, 8742 events. 1878/8742 cut-off events. For 67401/67429 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 95773 event pairs, 76 based on Foata normal form. 4/8552 useless extension candidates. Maximal degree in co-relation 89198. Up to 4759 conditions per place. [2023-11-30 03:40:33,665 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 1861 selfloop transitions, 548 changer transitions 1287/3718 dead transitions. [2023-11-30 03:40:33,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 3718 transitions, 119848 flow [2023-11-30 03:40:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-11-30 03:40:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-11-30 03:40:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 2302 transitions. [2023-11-30 03:40:33,669 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.33852941176470586 [2023-11-30 03:40:33,670 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 2302 transitions. [2023-11-30 03:40:33,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 2302 transitions. [2023-11-30 03:40:33,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:40:33,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 2302 transitions. [2023-11-30 03:40:33,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 46.04) internal successors, (2302), 50 states have internal predecessors, (2302), 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-30 03:40:33,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 136.0) internal successors, (6936), 51 states have internal predecessors, (6936), 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-30 03:40:33,690 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 136.0) internal successors, (6936), 51 states have internal predecessors, (6936), 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-30 03:40:33,697 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 507 predicate places. [2023-11-30 03:40:33,697 INFO L500 AbstractCegarLoop]: Abstraction has has 642 places, 3718 transitions, 119848 flow [2023-11-30 03:40:33,698 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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-30 03:40:33,698 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:40:33,698 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:40:33,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-30 03:40:33,905 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-30 03:40:33,905 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:40:33,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:40:33,906 INFO L85 PathProgramCache]: Analyzing trace with hash -519374445, now seen corresponding path program 12 times [2023-11-30 03:40:33,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:40:33,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278207785] [2023-11-30 03:40:33,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:40:33,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:40:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:40:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:40:35,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:40:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278207785] [2023-11-30 03:40:35,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278207785] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:40:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618572836] [2023-11-30 03:40:35,610 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-30 03:40:35,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:40:35,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:40:35,610 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:40:35,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-30 03:40:35,824 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-30 03:40:35,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:40:35,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-30 03:40:35,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:40:35,944 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-30 03:40:36,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:36,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-30 03:40:36,395 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:40:36,395 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 69 treesize of output 65 [2023-11-30 03:40:36,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:36,404 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 24 treesize of output 11 [2023-11-30 03:40:36,988 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:40:36,989 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 76 treesize of output 70 [2023-11-30 03:40:36,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:36,997 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 24 treesize of output 11 [2023-11-30 03:40:37,481 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-30 03:40:37,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:40:38,086 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 26 treesize of output 28 [2023-11-30 03:40:38,209 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 33 treesize of output 38 [2023-11-30 03:40:38,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:40:38,336 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 35 [2023-11-30 03:40:38,351 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-30 03:40:38,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:38,419 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-30 03:40:38,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:38,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-30 03:40:38,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:38,470 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-30 03:40:38,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:38,490 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-30 03:40:38,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:38,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:38,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:38,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:38,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:40:38,606 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 52 treesize of output 41 [2023-11-30 03:40:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:40:38,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:40:38,843 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2226 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2226 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2226 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2226 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false [2023-11-30 03:40:38,900 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse0) (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2226 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2226 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse0) (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2226 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2226 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse0))))) is different from false [2023-11-30 03:41:04,396 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse10 0) .cse8 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2226 Int)) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse4) (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2226 Int)) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse4) (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2226 Int)) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2226 Int)) (= 0 (select (select (let ((.cse9 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) .cse10))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse4)))))))) is different from false [2023-11-30 03:41:04,478 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse10 0) .cse7 0))) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_2224 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_41| Int) (v_ArrVal_2226 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5))) (forall ((v_ArrVal_2224 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_41| Int) (v_ArrVal_2226 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5))) (forall ((v_ArrVal_2224 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_41| Int) (v_ArrVal_2226 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse0) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5))) (forall ((v_ArrVal_2224 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_41| Int) (v_ArrVal_2226 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (= 0 (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2224))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2226))) c_threadThread1of1ForFork0_~p~0.base) .cse10)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5)))))) is different from false [2023-11-30 03:41:04,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:41:04,577 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 81 treesize of output 74 [2023-11-30 03:41:04,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:41:04,588 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 248 treesize of output 236 [2023-11-30 03:41:04,600 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 197 treesize of output 181 [2023-11-30 03:41:04,642 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 31 treesize of output 17 [2023-11-30 03:41:04,667 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 152 treesize of output 130 [2023-11-30 03:41:04,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:41:04,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-30 03:41:04,752 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:41:04,760 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-30 03:41:04,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130 [2023-11-30 03:41:04,768 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 48 treesize of output 44 [2023-11-30 03:41:04,774 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 80 treesize of output 62 [2023-11-30 03:41:04,796 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:41:04,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2023-11-30 03:41:04,802 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:41:04,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-30 03:41:05,795 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2212))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2214 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2211))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_2214) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_2213 (Array Int Int))) (not (= (select (select (store .cse2 .cse1 v_ArrVal_2213) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (forall ((v_ArrVal_2212 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2212) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-30 03:41:05,917 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_2212 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2212) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2212))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2214 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2211))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_2214) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_2213 (Array Int Int))) (not (= (select (select (store .cse3 .cse2 v_ArrVal_2213) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) is different from false [2023-11-30 03:41:05,959 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 497 treesize of output 461 [2023-11-30 03:41:05,985 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 30 treesize of output 26 [2023-11-30 03:41:05,989 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 11 [2023-11-30 03:41:06,363 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:41:06,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 10 treesize of output 4 [2023-11-30 03:41:06,558 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-30 03:41:06,558 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 800 treesize of output 523 [2023-11-30 03:41:06,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:41:06,572 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 99 treesize of output 97 [2023-11-30 03:41:06,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 70 treesize of output 62 [2023-11-30 03:41:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:41:06,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618572836] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:41:06,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:41:06,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 71 [2023-11-30 03:41:06,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817425299] [2023-11-30 03:41:06,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:41:06,744 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-30 03:41:06,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:41:06,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-30 03:41:06,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=3936, Unknown=61, NotChecked=798, Total=5112 [2023-11-30 03:41:06,747 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:41:06,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 3718 transitions, 119848 flow. Second operand has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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-30 03:41:06,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:41:06,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:41:06,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:41:28,186 INFO L124 PetriNetUnfolderBase]: 1971/9858 cut-off events. [2023-11-30 03:41:28,186 INFO L125 PetriNetUnfolderBase]: For 85694/85728 co-relation queries the response was YES. [2023-11-30 03:41:28,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116978 conditions, 9858 events. 1971/9858 cut-off events. For 85694/85728 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 113653 event pairs, 95 based on Foata normal form. 6/9660 useless extension candidates. Maximal degree in co-relation 102557. Up to 5191 conditions per place. [2023-11-30 03:41:28,247 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 1960 selfloop transitions, 603 changer transitions 1493/4078 dead transitions. [2023-11-30 03:41:28,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 4078 transitions, 139620 flow [2023-11-30 03:41:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-30 03:41:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-30 03:41:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 1970 transitions. [2023-11-30 03:41:28,249 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3448879551820728 [2023-11-30 03:41:28,250 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 1970 transitions. [2023-11-30 03:41:28,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 1970 transitions. [2023-11-30 03:41:28,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:41:28,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 1970 transitions. [2023-11-30 03:41:28,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 46.904761904761905) internal successors, (1970), 42 states have internal predecessors, (1970), 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-30 03:41:28,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 136.0) internal successors, (5848), 43 states have internal predecessors, (5848), 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-30 03:41:28,256 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 136.0) internal successors, (5848), 43 states have internal predecessors, (5848), 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-30 03:41:28,257 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 548 predicate places. [2023-11-30 03:41:28,257 INFO L500 AbstractCegarLoop]: Abstraction has has 683 places, 4078 transitions, 139620 flow [2023-11-30 03:41:28,257 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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-30 03:41:28,257 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:41:28,257 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:41:28,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-30 03:41:28,463 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-30 03:41:28,464 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:41:28,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:41:28,464 INFO L85 PathProgramCache]: Analyzing trace with hash 141149157, now seen corresponding path program 13 times [2023-11-30 03:41:28,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:41:28,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739004606] [2023-11-30 03:41:28,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:41:28,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:41:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:41:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:41:29,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:41:29,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739004606] [2023-11-30 03:41:29,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739004606] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:41:29,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806367521] [2023-11-30 03:41:29,960 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-30 03:41:29,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:41:29,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:41:29,961 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:41:29,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-30 03:41:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:41:30,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-30 03:41:30,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:41:30,167 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-30 03:41:30,191 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-30 03:41:30,191 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 21 treesize of output 29 [2023-11-30 03:41:30,243 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-30 03:41:30,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-30 03:41:30,440 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:41:30,440 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 70 treesize of output 64 [2023-11-30 03:41:30,445 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-30 03:41:30,796 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-30 03:41:30,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 77 treesize of output 73 [2023-11-30 03:41:30,801 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 20 treesize of output 11 [2023-11-30 03:41:30,811 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 22 treesize of output 16 [2023-11-30 03:41:30,999 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-30 03:41:31,124 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-30 03:41:31,227 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 30 treesize of output 32 [2023-11-30 03:41:31,271 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 21 treesize of output 13 [2023-11-30 03:41:31,274 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 15 treesize of output 7 [2023-11-30 03:41:31,341 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-30 03:41:31,359 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-30 03:41:31,372 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-30 03:41:31,389 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-30 03:41:31,457 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-30 03:41:31,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:41:31,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:41:31,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:41:31,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:41:31,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:41:31,548 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 58 treesize of output 47 [2023-11-30 03:41:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:41:31,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:41:31,864 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)))) is different from false [2023-11-30 03:41:31,934 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse1 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse3) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse3) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse3) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse3) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))))) is different from false [2023-11-30 03:41:32,024 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_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= 0 (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse3) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) .cse6))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse3) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse3) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse3) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))))))) is different from false [2023-11-30 03:41:34,067 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_43| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_43| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse1) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_48|) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_43| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_43| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse1) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_48|) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_43| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_43| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse1) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_48|) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_43| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_43| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_48|) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse1)))))))) is different from false [2023-11-30 03:41:36,124 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse8 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_43| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_48|) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_43| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_43| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_48|) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_43| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_43| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_43| .cse6) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= 0 (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_48|) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_43| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int))) (= (select (select (let ((.cse10 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_48|) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_43| .cse6)))))) is different from false [2023-11-30 03:41:36,227 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0) .cse5 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_43| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_48|) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_43| .cse6))) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_43| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_48|) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_43| .cse6))) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_43| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_43| .cse6) (= 0 (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_48|) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2395 Int) (v_ArrVal_2393 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_43| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_48| Int)) (or (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2393) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_48|) v_ArrVal_2395))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_48| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_43| .cse6)))))) is different from false [2023-11-30 03:41:36,373 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-30 03:41:36,373 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 746 treesize of output 568 [2023-11-30 03:41:36,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:41:36,394 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 244 treesize of output 240 [2023-11-30 03:41:36,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 226 treesize of output 210 [2023-11-30 03:41:36,484 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:41:36,492 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-30 03:41:36,492 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 714 treesize of output 1 [2023-11-30 03:41:36,497 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:41:36,520 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-11-30 03:41:36,521 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 498 treesize of output 441 [2023-11-30 03:41:36,528 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:41:36,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 73 [2023-11-30 03:41:36,553 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:41:36,562 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-30 03:41:36,563 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 746 treesize of output 1 [2023-11-30 03:41:37,335 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 158 treesize of output 142 [2023-11-30 03:41:37,340 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 50 treesize of output 46 [2023-11-30 03:41:37,345 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 21 [2023-11-30 03:41:37,359 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2381 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2381) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2383 (Array Int Int)) (v_ArrVal_2381 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2381))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_2383) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (not (= .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|))))))) is different from false [2023-11-30 03:41:37,408 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_2383 (Array Int Int)) (v_ArrVal_2381 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2381))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|)) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse1 .cse0 v_ArrVal_2383) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))) (forall ((v_ArrVal_2381 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2381) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))))) is different from false [2023-11-30 03:41:37,848 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-30 03:41:37,848 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 433 treesize of output 280 [2023-11-30 03:41:37,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:41:37,863 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 99 treesize of output 97 [2023-11-30 03:41:37,868 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 70 treesize of output 62 [2023-11-30 03:41:38,009 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-30 03:41:38,009 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 22 treesize of output 18 [2023-11-30 03:41:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:41:38,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806367521] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:41:38,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:41:38,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 24] total 64 [2023-11-30 03:41:38,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746464051] [2023-11-30 03:41:38,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:41:38,062 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-11-30 03:41:38,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:41:38,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-11-30 03:41:38,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2977, Unknown=15, NotChecked=936, Total=4160 [2023-11-30 03:41:38,064 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:41:38,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 4078 transitions, 139620 flow. Second operand has 65 states, 65 states have (on average 40.63076923076923) internal successors, (2641), 65 states have internal predecessors, (2641), 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-30 03:41:38,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:41:38,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:41:38,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:41:55,560 INFO L124 PetriNetUnfolderBase]: 2032/10127 cut-off events. [2023-11-30 03:41:55,561 INFO L125 PetriNetUnfolderBase]: For 99015/99051 co-relation queries the response was YES. [2023-11-30 03:41:55,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126916 conditions, 10127 events. 2032/10127 cut-off events. For 99015/99051 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 117485 event pairs, 98 based on Foata normal form. 6/9926 useless extension candidates. Maximal degree in co-relation 111687. Up to 5338 conditions per place. [2023-11-30 03:41:55,625 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 2060 selfloop transitions, 628 changer transitions 1493/4203 dead transitions. [2023-11-30 03:41:55,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 728 places, 4203 transitions, 152376 flow [2023-11-30 03:41:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-30 03:41:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-11-30 03:41:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 2130 transitions. [2023-11-30 03:41:55,629 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.34047314578005117 [2023-11-30 03:41:55,629 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 2130 transitions. [2023-11-30 03:41:55,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 2130 transitions. [2023-11-30 03:41:55,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:41:55,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 2130 transitions. [2023-11-30 03:41:55,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 46.30434782608695) internal successors, (2130), 46 states have internal predecessors, (2130), 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-30 03:41:55,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 136.0) internal successors, (6392), 47 states have internal predecessors, (6392), 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-30 03:41:55,637 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 136.0) internal successors, (6392), 47 states have internal predecessors, (6392), 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-30 03:41:55,637 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 593 predicate places. [2023-11-30 03:41:55,637 INFO L500 AbstractCegarLoop]: Abstraction has has 728 places, 4203 transitions, 152376 flow [2023-11-30 03:41:55,638 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 40.63076923076923) internal successors, (2641), 65 states have internal predecessors, (2641), 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-30 03:41:55,638 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:41:55,638 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:41:55,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-30 03:41:55,844 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:41:55,844 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:41:55,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:41:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1743046743, now seen corresponding path program 14 times [2023-11-30 03:41:55,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:41:55,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508298909] [2023-11-30 03:41:55,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:41:55,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:41:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:41:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:41:58,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:41:58,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508298909] [2023-11-30 03:41:58,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508298909] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:41:58,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715312466] [2023-11-30 03:41:58,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 03:41:58,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:41:58,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:41:58,928 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:41:58,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-30 03:41:59,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 03:41:59,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:41:59,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-30 03:41:59,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:41:59,794 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-30 03:41:59,794 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-30 03:41:59,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:41:59,807 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-30 03:42:00,470 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:42:00,470 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 76 treesize of output 70 [2023-11-30 03:42:00,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:00,482 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 24 treesize of output 11 [2023-11-30 03:42:00,944 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-30 03:42:01,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:42:01,421 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 26 treesize of output 28 [2023-11-30 03:42:01,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:42:01,551 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-30 03:42:01,565 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-30 03:42:01,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:01,644 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 30 treesize of output 21 [2023-11-30 03:42:01,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:01,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 30 treesize of output 21 [2023-11-30 03:42:01,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:01,685 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 30 treesize of output 21 [2023-11-30 03:42:01,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:01,710 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 30 treesize of output 21 [2023-11-30 03:42:01,798 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 33 treesize of output 38 [2023-11-30 03:42:01,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:01,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:01,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:01,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:01,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:42:01,917 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 52 treesize of output 41 [2023-11-30 03:42:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:42:01,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:42:02,345 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false [2023-11-30 03:42:02,432 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse1 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= 0 (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))))) is different from false [2023-11-30 03:42:04,486 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0)))))) is different from false [2023-11-30 03:42:04,547 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0) .cse9 0))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse10 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))))))) is different from false [2023-11-30 03:42:06,664 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse7 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_45| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_45| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int))) (= (select (select (let ((.cse10 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0))))))))) is different from false [2023-11-30 03:42:06,736 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0) .cse10 0))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int) (v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int) (v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse4) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int) (v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse4) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int) (v_ArrVal_2564 Int) (v_ArrVal_2561 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse4) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2561) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2564))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse5)))))) is different from false [2023-11-30 03:42:06,783 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-30 03:42:06,783 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 348 treesize of output 284 [2023-11-30 03:42:06,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:42:06,803 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 228 treesize of output 224 [2023-11-30 03:42:06,813 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 206 treesize of output 198 [2023-11-30 03:42:06,903 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:42:06,921 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-30 03:42:06,922 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 364 treesize of output 273 [2023-11-30 03:42:06,927 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:42:06,929 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 133 treesize of output 123 [2023-11-30 03:42:06,956 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:42:06,964 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-30 03:42:06,965 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 364 treesize of output 1 [2023-11-30 03:42:06,969 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:42:06,990 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-30 03:42:06,990 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 240 treesize of output 221 [2023-11-30 03:42:06,994 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:42:06,997 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 97 treesize of output 91 [2023-11-30 03:42:07,643 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2549))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2552 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_2552) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2551 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2550))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_2551) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_2549 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2549) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-30 03:42:07,697 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_53| Int)) (or (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2550 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_53| v_ArrVal_2549))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2551 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_53| v_ArrVal_2550))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_2551) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_2552 (Array Int Int))) (not (= (select (select (store .cse2 .cse1 v_ArrVal_2552) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (< .cse3 |v_ULTIMATE.start_main_#t~mem8#1.base_53|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_53| Int)) (or (forall ((v_ArrVal_2549 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_53| v_ArrVal_2549) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse3 |v_ULTIMATE.start_main_#t~mem8#1.base_53|))))) is different from false [2023-11-30 03:42:07,748 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 222 treesize of output 202 [2023-11-30 03:42:07,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-11-30 03:42:07,759 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 21 [2023-11-30 03:42:08,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-30 03:42:08,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:42:08,119 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-30 03:42:08,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:42:08,131 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 33 treesize of output 35 [2023-11-30 03:42:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:42:08,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715312466] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:42:08,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:42:08,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 70 [2023-11-30 03:42:08,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500472984] [2023-11-30 03:42:08,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:42:08,305 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-30 03:42:08,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:42:08,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-30 03:42:08,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=3656, Unknown=18, NotChecked=1032, Total=4970 [2023-11-30 03:42:08,308 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:42:08,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 728 places, 4203 transitions, 152376 flow. Second operand has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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-30 03:42:08,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:42:08,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:42:08,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:42:30,090 INFO L124 PetriNetUnfolderBase]: 2092/10401 cut-off events. [2023-11-30 03:42:30,090 INFO L125 PetriNetUnfolderBase]: For 113718/113752 co-relation queries the response was YES. [2023-11-30 03:42:30,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137188 conditions, 10401 events. 2092/10401 cut-off events. For 113718/113752 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 121367 event pairs, 100 based on Foata normal form. 4/10195 useless extension candidates. Maximal degree in co-relation 121150. Up to 5484 conditions per place. [2023-11-30 03:42:30,177 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 2150 selfloop transitions, 662 changer transitions 1493/4327 dead transitions. [2023-11-30 03:42:30,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 771 places, 4327 transitions, 165590 flow [2023-11-30 03:42:30,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-30 03:42:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-11-30 03:42:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 2074 transitions. [2023-11-30 03:42:30,181 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3465909090909091 [2023-11-30 03:42:30,181 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 2074 transitions. [2023-11-30 03:42:30,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 2074 transitions. [2023-11-30 03:42:30,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:42:30,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 2074 transitions. [2023-11-30 03:42:30,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 47.13636363636363) internal successors, (2074), 44 states have internal predecessors, (2074), 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-30 03:42:30,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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-30 03:42:30,189 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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-30 03:42:30,189 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 636 predicate places. [2023-11-30 03:42:30,189 INFO L500 AbstractCegarLoop]: Abstraction has has 771 places, 4327 transitions, 165590 flow [2023-11-30 03:42:30,190 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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-30 03:42:30,190 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:30,190 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:30,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-30 03:42:30,397 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:42:30,397 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:42:30,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:30,398 INFO L85 PathProgramCache]: Analyzing trace with hash -914521871, now seen corresponding path program 15 times [2023-11-30 03:42:30,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:30,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736399641] [2023-11-30 03:42:30,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:30,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:42:31,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:42:31,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736399641] [2023-11-30 03:42:31,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736399641] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:42:31,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020486088] [2023-11-30 03:42:31,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 03:42:31,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:42:31,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:42:31,946 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:42:31,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-30 03:42:32,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-30 03:42:32,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:42:32,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-30 03:42:32,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:42:32,300 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-30 03:42:32,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:32,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-30 03:42:32,704 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:42:32,704 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 69 treesize of output 65 [2023-11-30 03:42:32,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:32,710 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 24 treesize of output 11 [2023-11-30 03:42:33,253 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:42:33,254 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 76 treesize of output 70 [2023-11-30 03:42:33,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:33,262 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 24 treesize of output 11 [2023-11-30 03:42:33,656 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-30 03:42:33,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:42:34,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:42:34,117 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-30 03:42:34,129 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-30 03:42:34,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:34,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:42:34,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:34,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:42:34,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:34,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:42:34,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:34,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:42:34,338 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 26 treesize of output 28 [2023-11-30 03:42:34,408 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 33 treesize of output 38 [2023-11-30 03:42:34,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:34,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:34,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:34,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:42:34,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:42:34,520 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 52 treesize of output 41 [2023-11-30 03:42:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:42:34,578 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:42:35,858 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (forall ((v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (= (select (select (let ((.cse1 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse3) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (forall ((v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (= 0 (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse3) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) .cse5))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (forall ((v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse3) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (forall ((v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (= (select (select (let ((.cse11 (let ((.cse12 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse11 .cse2 (store (select .cse11 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse3) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))))) is different from false [2023-11-30 03:42:35,972 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (forall ((v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse3) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (forall ((v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse3) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (forall ((v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse3) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (forall ((v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (= (select (select (let ((.cse10 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse3) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))))) is different from false [2023-11-30 03:42:38,027 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_47| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_47| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse1) (forall ((v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (= 0 (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) .cse5))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_47| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_47| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse1) (forall ((v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_47| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_47| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (forall ((v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse1))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_47| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_47| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse1) (forall ((v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (= (select (select (let ((.cse10 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse10 .cse3 (store (select .cse10 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))))))) is different from false [2023-11-30 03:42:38,111 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_47| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int) (v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse5 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_47| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_47| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int) (v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_47| .cse6) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse5 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_47| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int) (v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_47| .cse6) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse5 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_47| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int) (v_ArrVal_2732 Int) (v_ArrVal_2728 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (= 0 (select (select (let ((.cse10 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2728) c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse5 0)))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2732))) c_threadThread1of1ForFork0_~p~0.base) .cse4)) (< |v_ULTIMATE.start_main_~i~1#1_47| .cse6)))))) is different from false [2023-11-30 03:42:38,224 INFO L349 Elim1Store]: treesize reduction 26, result has 63.9 percent of original size [2023-11-30 03:42:38,224 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 344 treesize of output 305 [2023-11-30 03:42:38,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:42:38,240 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 259 treesize of output 255 [2023-11-30 03:42:38,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 226 treesize of output 210 [2023-11-30 03:42:38,362 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:42:38,387 INFO L349 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2023-11-30 03:42:38,388 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 240 treesize of output 226 [2023-11-30 03:42:38,396 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:42:38,400 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 102 treesize of output 96 [2023-11-30 03:42:38,435 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:42:38,445 INFO L349 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2023-11-30 03:42:38,446 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 328 treesize of output 1 [2023-11-30 03:42:38,454 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:42:38,463 INFO L349 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2023-11-30 03:42:38,463 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 240 treesize of output 1 [2023-11-30 03:42:39,358 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2719 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2719) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_2719 (Array Int Int)) (v_ArrVal_2718 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2719))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2721 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2718))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_2721) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_2720 (Array Int Int))) (not (= (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse2 .cse1 v_ArrVal_2720) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))))) is different from false [2023-11-30 03:42:39,418 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_2719 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2719) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2719 (Array Int Int)) (v_ArrVal_2718 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2719))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2721 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2718))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_2721) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_2720 (Array Int Int))) (not (= (select (select (store .cse3 .cse2 v_ArrVal_2720) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) is different from false [2023-11-30 03:42:39,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 259 [2023-11-30 03:42:39,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 33 treesize of output 31 [2023-11-30 03:42:39,464 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 64 treesize of output 60 [2023-11-30 03:42:39,734 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:42:39,736 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 4 [2023-11-30 03:42:39,998 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-30 03:42:39,999 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 602 treesize of output 405 [2023-11-30 03:42:40,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:42:40,014 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 99 treesize of output 97 [2023-11-30 03:42:40,019 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 70 treesize of output 62 [2023-11-30 03:42:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:42:40,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020486088] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:42:40,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:42:40,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 70 [2023-11-30 03:42:40,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067284477] [2023-11-30 03:42:40,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:42:40,190 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-30 03:42:40,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:42:40,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-30 03:42:40,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=3864, Unknown=29, NotChecked=786, Total=4970 [2023-11-30 03:42:40,193 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:42:40,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 771 places, 4327 transitions, 165590 flow. Second operand has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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-30 03:42:40,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:42:40,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:42:40,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:43:06,434 INFO L124 PetriNetUnfolderBase]: 2209/11117 cut-off events. [2023-11-30 03:43:06,434 INFO L125 PetriNetUnfolderBase]: For 132911/132951 co-relation queries the response was YES. [2023-11-30 03:43:06,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152964 conditions, 11117 events. 2209/11117 cut-off events. For 132911/132951 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 132115 event pairs, 115 based on Foata normal form. 6/10891 useless extension candidates. Maximal degree in co-relation 134821. Up to 5827 conditions per place. [2023-11-30 03:43:06,522 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 2306 selfloop transitions, 726 changer transitions 1555/4609 dead transitions. [2023-11-30 03:43:06,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 813 places, 4609 transitions, 185782 flow [2023-11-30 03:43:06,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-30 03:43:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-11-30 03:43:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 2046 transitions. [2023-11-30 03:43:06,525 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.34986320109439123 [2023-11-30 03:43:06,525 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 2046 transitions. [2023-11-30 03:43:06,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 2046 transitions. [2023-11-30 03:43:06,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:43:06,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 2046 transitions. [2023-11-30 03:43:06,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 47.58139534883721) internal successors, (2046), 43 states have internal predecessors, (2046), 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-30 03:43:06,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 136.0) internal successors, (5984), 44 states have internal predecessors, (5984), 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-30 03:43:06,555 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 136.0) internal successors, (5984), 44 states have internal predecessors, (5984), 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-30 03:43:06,556 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 678 predicate places. [2023-11-30 03:43:06,556 INFO L500 AbstractCegarLoop]: Abstraction has has 813 places, 4609 transitions, 185782 flow [2023-11-30 03:43:06,556 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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-30 03:43:06,556 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:43:06,556 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:43:06,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-30 03:43:06,763 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:43:06,764 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:43:06,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:43:06,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2017398601, now seen corresponding path program 16 times [2023-11-30 03:43:06,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:43:06,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72780399] [2023-11-30 03:43:06,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:43:06,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:43:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:43:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:43:08,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:43:08,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72780399] [2023-11-30 03:43:08,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72780399] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:43:08,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366883110] [2023-11-30 03:43:08,259 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-30 03:43:08,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:43:08,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:43:08,259 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:43:08,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-30 03:43:08,729 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-30 03:43:08,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:43:08,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-30 03:43:08,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:43:09,230 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-30 03:43:09,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 44 [2023-11-30 03:43:09,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:09,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 03:43:09,913 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:43:09,913 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 76 treesize of output 70 [2023-11-30 03:43:09,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:09,919 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 24 treesize of output 11 [2023-11-30 03:43:10,381 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-30 03:43:10,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:43:10,765 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 26 treesize of output 28 [2023-11-30 03:43:11,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:43:11,171 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-30 03:43:11,188 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-30 03:43:11,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:11,285 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 30 treesize of output 21 [2023-11-30 03:43:11,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:11,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 30 treesize of output 21 [2023-11-30 03:43:11,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:11,323 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 30 treesize of output 21 [2023-11-30 03:43:11,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:11,343 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 30 treesize of output 21 [2023-11-30 03:43:11,509 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 33 treesize of output 38 [2023-11-30 03:43:11,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:11,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:11,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:11,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:11,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:43:11,615 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 52 treesize of output 41 [2023-11-30 03:43:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:43:11,670 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:43:12,022 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false [2023-11-30 03:43:12,096 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0) (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= 0 (select (select (let ((.cse1 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse3) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse3) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse3) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse3) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0))))) is different from false [2023-11-30 03:43:14,180 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse1) (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse2 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse1))) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse1))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse10 .cse3 (store (select .cse10 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse1))))))) is different from false [2023-11-30 03:43:16,235 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0) (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_49| .cse6) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0) (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0))) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse6)))))) is different from false [2023-11-30 03:43:18,296 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0) .cse7 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse5) (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse5))) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse5) (forall ((v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2901 Int)) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0))))))))) is different from false [2023-11-30 03:43:18,400 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0) .cse8 0))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int) (v_ArrVal_2898 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int) (v_ArrVal_2901 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int) (v_ArrVal_2898 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int) (v_ArrVal_2901 Int)) (or (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int) (v_ArrVal_2898 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int) (v_ArrVal_2901 Int)) (or (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int) (v_ArrVal_2898 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int) (v_ArrVal_2901 Int)) (or (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2898) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2901))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse5)))))) is different from false [2023-11-30 03:43:18,520 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-30 03:43:18,520 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 364 treesize of output 300 [2023-11-30 03:43:18,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:43:18,535 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 244 treesize of output 240 [2023-11-30 03:43:18,544 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 226 treesize of output 210 [2023-11-30 03:43:18,617 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:43:18,625 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-30 03:43:18,625 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 348 treesize of output 1 [2023-11-30 03:43:18,629 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:43:18,648 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-11-30 03:43:18,649 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 240 treesize of output 225 [2023-11-30 03:43:18,653 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:43:18,660 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-30 03:43:18,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 95 [2023-11-30 03:43:18,684 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:43:18,691 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-30 03:43:18,692 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 364 treesize of output 1 [2023-11-30 03:43:19,375 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2887 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2887) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2886 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2887))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2889 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2886))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_2889) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_2888 (Array Int Int))) (not (= (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse2 .cse1 v_ArrVal_2888) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))))) is different from false [2023-11-30 03:43:19,434 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_59| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_59|) (forall ((v_ArrVal_2887 (Array Int Int)) (v_ArrVal_2886 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_59| v_ArrVal_2887))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2888 (Array Int Int))) (not (= (select (select (store .cse1 .cse2 v_ArrVal_2888) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2889 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_59| v_ArrVal_2886))) (< (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse3 .cse2 v_ArrVal_2889) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_59| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_59|) (forall ((v_ArrVal_2887 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_59| v_ArrVal_2887) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) is different from false [2023-11-30 03:43:19,487 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 376 treesize of output 340 [2023-11-30 03:43:19,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-30 03:43:19,498 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-30 03:43:19,735 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 20 treesize of output 18 [2023-11-30 03:43:19,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:43:19,855 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-30 03:43:19,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:43:19,867 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 33 treesize of output 35 [2023-11-30 03:43:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:43:19,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366883110] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:43:19,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:43:19,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 70 [2023-11-30 03:43:19,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335272293] [2023-11-30 03:43:19,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:43:19,989 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-30 03:43:19,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:43:19,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-30 03:43:19,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=3655, Unknown=15, NotChecked=1032, Total=4970 [2023-11-30 03:43:19,991 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:43:19,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 813 places, 4609 transitions, 185782 flow. Second operand has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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-30 03:43:19,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:43:19,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:43:19,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:43:42,877 INFO L124 PetriNetUnfolderBase]: 2255/11333 cut-off events. [2023-11-30 03:43:42,877 INFO L125 PetriNetUnfolderBase]: For 150308/150346 co-relation queries the response was YES. [2023-11-30 03:43:42,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163406 conditions, 11333 events. 2255/11333 cut-off events. For 150308/150346 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 135114 event pairs, 117 based on Foata normal form. 4/11102 useless extension candidates. Maximal degree in co-relation 144392. Up to 5939 conditions per place. [2023-11-30 03:43:42,962 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 2415 selfloop transitions, 718 changer transitions 1555/4710 dead transitions. [2023-11-30 03:43:42,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 861 places, 4710 transitions, 199306 flow [2023-11-30 03:43:42,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-30 03:43:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-11-30 03:43:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 2271 transitions. [2023-11-30 03:43:42,964 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3407863145258103 [2023-11-30 03:43:42,965 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 2271 transitions. [2023-11-30 03:43:42,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 2271 transitions. [2023-11-30 03:43:42,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:43:42,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 2271 transitions. [2023-11-30 03:43:42,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 46.3469387755102) internal successors, (2271), 49 states have internal predecessors, (2271), 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-30 03:43:42,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 136.0) internal successors, (6800), 50 states have internal predecessors, (6800), 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-30 03:43:42,972 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 136.0) internal successors, (6800), 50 states have internal predecessors, (6800), 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-30 03:43:42,972 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 726 predicate places. [2023-11-30 03:43:42,972 INFO L500 AbstractCegarLoop]: Abstraction has has 861 places, 4710 transitions, 199306 flow [2023-11-30 03:43:42,973 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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-30 03:43:42,973 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:43:42,973 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:43:42,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-30 03:43:43,179 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-30 03:43:43,180 INFO L425 AbstractCegarLoop]: === Iteration 23 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:43:43,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:43:43,180 INFO L85 PathProgramCache]: Analyzing trace with hash -174703321, now seen corresponding path program 17 times [2023-11-30 03:43:43,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:43:43,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246787073] [2023-11-30 03:43:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:43:43,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:43:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:43:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:43:44,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:43:44,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246787073] [2023-11-30 03:43:44,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246787073] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:43:44,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506611170] [2023-11-30 03:43:44,469 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-30 03:43:44,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:43:44,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:43:44,470 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:43:44,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-30 03:43:44,838 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 03:43:44,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:43:44,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-30 03:43:44,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:43:44,945 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-30 03:43:44,991 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-30 03:43:44,992 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-30 03:43:45,112 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-11-30 03:43:45,113 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 26 treesize of output 41 [2023-11-30 03:43:45,202 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2023-11-30 03:43:45,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2023-11-30 03:43:45,765 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:43:45,766 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 77 treesize of output 69 [2023-11-30 03:43:45,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-30 03:43:46,453 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:43:46,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 74 [2023-11-30 03:43:46,461 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 24 treesize of output 11 [2023-11-30 03:43:46,915 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-30 03:43:47,420 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 03:43:47,420 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 59 treesize of output 31 [2023-11-30 03:43:47,440 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 7 treesize of output 3 [2023-11-30 03:43:47,501 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-30 03:43:47,512 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-30 03:43:47,523 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-30 03:43:47,541 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-30 03:43:47,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:43:47,673 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 26 treesize of output 28 [2023-11-30 03:43:47,743 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 33 treesize of output 38 [2023-11-30 03:43:47,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:47,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:47,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:47,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:47,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:43:47,853 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 52 treesize of output 41 [2023-11-30 03:43:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:43:47,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:43:48,835 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (and (forall ((v_ArrVal_3072 Int) (v_ArrVal_3066 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3066))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (store (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0) .cse5 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3072))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_3072 Int) (v_ArrVal_3066 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3066))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (store (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0) .cse5 0))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3072))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (forall ((v_ArrVal_3072 Int) (v_ArrVal_3066 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3066))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (store (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0) .cse5 0))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3072))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (forall ((v_ArrVal_3072 Int) (v_ArrVal_3066 (Array Int Int))) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3066))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (store (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0) .cse5 0))))) (store .cse10 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse10 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3072))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)))) is different from false [2023-11-30 03:44:01,744 INFO L349 Elim1Store]: treesize reduction 44, result has 29.0 percent of original size [2023-11-30 03:44:01,745 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 240 treesize of output 235 [2023-11-30 03:44:01,757 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-30 03:44:01,757 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 187 treesize of output 181 [2023-11-30 03:44:01,805 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2023-11-30 03:44:01,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 240 treesize of output 1 [2023-11-30 03:44:01,819 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2023-11-30 03:44:01,819 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 240 treesize of output 1 [2023-11-30 03:44:01,861 INFO L349 Elim1Store]: treesize reduction 21, result has 66.1 percent of original size [2023-11-30 03:44:01,861 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 308 treesize of output 294 [2023-11-30 03:44:01,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:44:01,877 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 258 treesize of output 254 [2023-11-30 03:44:01,887 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 206 treesize of output 198 [2023-11-30 03:44:04,851 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 504 treesize of output 468 [2023-11-30 03:44:04,862 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 15 treesize of output 13 [2023-11-30 03:44:04,864 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 28 treesize of output 24 [2023-11-30 03:44:05,691 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-30 03:44:05,692 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 570 treesize of output 357 [2023-11-30 03:44:05,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:44:05,704 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 97 treesize of output 95 [2023-11-30 03:44:05,708 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 62 [2023-11-30 03:44:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-30 03:44:06,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506611170] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:44:06,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:44:06,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28, 26] total 77 [2023-11-30 03:44:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291344410] [2023-11-30 03:44:06,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:44:06,248 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2023-11-30 03:44:06,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:44:06,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2023-11-30 03:44:06,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=5447, Unknown=42, NotChecked=150, Total=6006 [2023-11-30 03:44:06,251 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 136 [2023-11-30 03:44:06,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 861 places, 4710 transitions, 199306 flow. Second operand has 78 states, 78 states have (on average 30.46153846153846) internal successors, (2376), 78 states have internal predecessors, (2376), 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-30 03:44:06,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:44:06,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 136 [2023-11-30 03:44:06,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:44:27,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 03:44:34,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 03:45:16,097 INFO L124 PetriNetUnfolderBase]: 2434/11878 cut-off events. [2023-11-30 03:45:16,097 INFO L125 PetriNetUnfolderBase]: For 171620/171660 co-relation queries the response was YES. [2023-11-30 03:45:16,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180474 conditions, 11878 events. 2434/11878 cut-off events. For 171620/171660 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 141893 event pairs, 96 based on Foata normal form. 4/11614 useless extension candidates. Maximal degree in co-relation 160528. Up to 6271 conditions per place. [2023-11-30 03:45:16,201 INFO L140 encePairwiseOnDemand]: 93/136 looper letters, 2634 selfloop transitions, 846 changer transitions 1620/5115 dead transitions. [2023-11-30 03:45:16,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 5115 transitions, 226926 flow [2023-11-30 03:45:16,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-30 03:45:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2023-11-30 03:45:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 2248 transitions. [2023-11-30 03:45:16,214 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.25827205882352944 [2023-11-30 03:45:16,214 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 2248 transitions. [2023-11-30 03:45:16,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 2248 transitions. [2023-11-30 03:45:16,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:45:16,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 2248 transitions. [2023-11-30 03:45:16,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 35.125) internal successors, (2248), 64 states have internal predecessors, (2248), 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-30 03:45:16,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 136.0) internal successors, (8840), 65 states have internal predecessors, (8840), 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-30 03:45:16,223 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 136.0) internal successors, (8840), 65 states have internal predecessors, (8840), 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-30 03:45:16,224 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 789 predicate places. [2023-11-30 03:45:16,224 INFO L500 AbstractCegarLoop]: Abstraction has has 924 places, 5115 transitions, 226926 flow [2023-11-30 03:45:16,224 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 30.46153846153846) internal successors, (2376), 78 states have internal predecessors, (2376), 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-30 03:45:16,224 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:45:16,224 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:45:16,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-30 03:45:16,431 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:45:16,431 INFO L425 AbstractCegarLoop]: === Iteration 24 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:45:16,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:45:16,432 INFO L85 PathProgramCache]: Analyzing trace with hash -862245265, now seen corresponding path program 18 times [2023-11-30 03:45:16,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:45:16,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652772239] [2023-11-30 03:45:16,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:45:16,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:45:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:45:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:45:18,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:45:18,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652772239] [2023-11-30 03:45:18,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652772239] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:45:18,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402804924] [2023-11-30 03:45:18,056 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-30 03:45:18,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:45:18,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:45:18,060 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:45:18,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-30 03:45:18,325 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-30 03:45:18,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:45:18,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-30 03:45:18,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:45:18,913 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-30 03:45:18,914 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-30 03:45:18,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:18,923 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-30 03:45:19,552 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:45:19,553 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 76 treesize of output 70 [2023-11-30 03:45:19,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:19,562 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 24 treesize of output 11 [2023-11-30 03:45:19,999 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-30 03:45:20,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 19 treesize of output 18 [2023-11-30 03:45:20,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:45:20,475 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 35 [2023-11-30 03:45:20,487 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-30 03:45:20,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:20,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:45:20,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:20,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:45:20,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:20,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:45:20,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:20,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:45:20,679 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 26 treesize of output 28 [2023-11-30 03:45:20,745 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 33 treesize of output 38 [2023-11-30 03:45:20,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:20,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:20,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:20,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:20,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:45:20,863 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 52 treesize of output 41 [2023-11-30 03:45:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:45:20,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:45:21,409 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (and (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= 0 (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse9 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse9 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)))) is different from false [2023-11-30 03:45:21,503 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse0) (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= (select (select (let ((.cse1 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse3) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse0) (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse3) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse0) (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse3) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse0) (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse11 .cse2 (store (select .cse11 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse3) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) is different from false [2023-11-30 03:45:23,641 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_53| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_53| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse1) (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= (select (select (let ((.cse2 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| (* |v_ULTIMATE.start_main_~i~1#1_53| 4)) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_53| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_53| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse1) (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| (* |v_ULTIMATE.start_main_~i~1#1_53| 4)) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_53| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_53| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse1) (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= 0 (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| (* |v_ULTIMATE.start_main_~i~1#1_53| 4)) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) .cse5))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_53| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_53| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse1) (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0))))) (store .cse11 .cse3 (store (select .cse11 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| (* |v_ULTIMATE.start_main_~i~1#1_53| 4)) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))))))) is different from false [2023-11-30 03:45:25,234 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_53| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_53| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse1) (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| (* |v_ULTIMATE.start_main_~i~1#1_53| 4)) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_53| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_53| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse1) (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| (* |v_ULTIMATE.start_main_~i~1#1_53| 4)) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_53| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_53| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse1) (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| (* |v_ULTIMATE.start_main_~i~1#1_53| 4)) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_53| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_53| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int)) (or (forall ((v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3240 Int)) (= (select (select (let ((.cse10 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse10 .cse3 (store (select .cse10 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| (* |v_ULTIMATE.start_main_~i~1#1_53| 4)) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse1)))))))) is different from false [2023-11-30 03:45:27,316 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int) (v_ArrVal_3235 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_53| Int) (v_ArrVal_3240 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_53| .cse1) (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| (* |v_ULTIMATE.start_main_~i~1#1_53| 4)) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int) (v_ArrVal_3235 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_53| Int) (v_ArrVal_3240 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse0) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| (* |v_ULTIMATE.start_main_~i~1#1_53| 4)) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_53| .cse1))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int) (v_ArrVal_3235 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_53| Int) (v_ArrVal_3240 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_53| .cse1) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| (* |v_ULTIMATE.start_main_~i~1#1_53| 4)) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_63| Int) (v_ArrVal_3235 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_53| Int) (v_ArrVal_3240 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_63| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_53| .cse1) (= (select (select (let ((.cse10 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3235) c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse6 0)))) (store .cse10 .cse3 (store (select .cse10 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_63| (* |v_ULTIMATE.start_main_~i~1#1_53| 4)) v_ArrVal_3240))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))))) is different from false [2023-11-30 03:45:27,395 INFO L349 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2023-11-30 03:45:27,396 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 498 treesize of output 452 [2023-11-30 03:45:27,401 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 152 treesize of output 146 [2023-11-30 03:45:27,460 INFO L349 Elim1Store]: treesize reduction 26, result has 63.9 percent of original size [2023-11-30 03:45:27,461 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 706 treesize of output 583 [2023-11-30 03:45:27,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:45:27,475 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 259 treesize of output 255 [2023-11-30 03:45:27,484 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 226 treesize of output 210 [2023-11-30 03:45:27,497 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:45:27,521 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:45:27,527 INFO L349 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2023-11-30 03:45:27,528 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 498 treesize of output 1 [2023-11-30 03:45:27,532 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:45:27,538 INFO L349 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2023-11-30 03:45:27,538 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 674 treesize of output 1 [2023-11-30 03:45:28,179 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3226 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3225))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_3227 (Array Int Int))) (not (= (select (select (store .cse0 .cse1 v_ArrVal_3227) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_3228 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3226))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_3228) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_3225 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3225) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-30 03:45:28,237 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_65| Int)) (or (forall ((v_ArrVal_3225 (Array Int Int)) (v_ArrVal_3226 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_65| v_ArrVal_3225))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_3228 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_65| v_ArrVal_3226))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_3228) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_3227 (Array Int Int))) (not (= (select (select (store .cse2 .cse1 v_ArrVal_3227) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (< .cse3 |v_ULTIMATE.start_main_#t~mem8#1.base_65|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_65| Int)) (or (forall ((v_ArrVal_3225 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_65| v_ArrVal_3225) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse3 |v_ULTIMATE.start_main_#t~mem8#1.base_65|))))) is different from false [2023-11-30 03:45:28,296 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 376 treesize of output 340 [2023-11-30 03:45:28,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-30 03:45:28,310 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-30 03:45:28,557 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 20 treesize of output 18 [2023-11-30 03:45:28,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:45:28,685 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-30 03:45:28,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:45:28,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2023-11-30 03:45:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:45:29,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402804924] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:45:29,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:45:29,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 70 [2023-11-30 03:45:29,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529837636] [2023-11-30 03:45:29,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:45:29,058 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-30 03:45:29,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:45:29,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-30 03:45:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=3766, Unknown=13, NotChecked=910, Total=4970 [2023-11-30 03:45:29,060 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:45:29,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 5115 transitions, 226926 flow. Second operand has 71 states, 71 states have (on average 40.521126760563384) internal successors, (2877), 71 states have internal predecessors, (2877), 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-30 03:45:29,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:45:29,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:45:29,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:45:57,285 INFO L124 PetriNetUnfolderBase]: 2490/12112 cut-off events. [2023-11-30 03:45:57,285 INFO L125 PetriNetUnfolderBase]: For 191995/192037 co-relation queries the response was YES. [2023-11-30 03:45:57,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192211 conditions, 12112 events. 2490/12112 cut-off events. For 191995/192037 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 145106 event pairs, 98 based on Foata normal form. 4/11844 useless extension candidates. Maximal degree in co-relation 171394. Up to 6425 conditions per place. [2023-11-30 03:45:57,381 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 2794 selfloop transitions, 819 changer transitions 1620/5255 dead transitions. [2023-11-30 03:45:57,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 971 places, 5255 transitions, 243712 flow [2023-11-30 03:45:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-30 03:45:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-11-30 03:45:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 2253 transitions. [2023-11-30 03:45:57,384 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.34512867647058826 [2023-11-30 03:45:57,384 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 2253 transitions. [2023-11-30 03:45:57,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 2253 transitions. [2023-11-30 03:45:57,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:45:57,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 2253 transitions. [2023-11-30 03:45:57,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 46.9375) internal successors, (2253), 48 states have internal predecessors, (2253), 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-30 03:45:57,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 136.0) internal successors, (6664), 49 states have internal predecessors, (6664), 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-30 03:45:57,392 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 136.0) internal successors, (6664), 49 states have internal predecessors, (6664), 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-30 03:45:57,392 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 836 predicate places. [2023-11-30 03:45:57,392 INFO L500 AbstractCegarLoop]: Abstraction has has 971 places, 5255 transitions, 243712 flow [2023-11-30 03:45:57,393 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 40.521126760563384) internal successors, (2877), 71 states have internal predecessors, (2877), 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-30 03:45:57,393 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:45:57,393 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:45:57,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-30 03:45:57,600 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:45:57,601 INFO L425 AbstractCegarLoop]: === Iteration 25 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:45:57,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:45:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1518975207, now seen corresponding path program 19 times [2023-11-30 03:45:57,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:45:57,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973699795] [2023-11-30 03:45:57,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:45:57,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:45:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:45:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:45:58,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:45:58,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973699795] [2023-11-30 03:45:58,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973699795] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:45:58,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036000818] [2023-11-30 03:45:58,890 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-30 03:45:58,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:45:58,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:45:58,891 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:45:58,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-30 03:45:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:45:59,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-30 03:45:59,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:45:59,148 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-30 03:45:59,170 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:45:59,171 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-30 03:45:59,370 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:45:59,371 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 43 treesize of output 45 [2023-11-30 03:45:59,696 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-30 03:45:59,696 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 66 treesize of output 66 [2023-11-30 03:45:59,701 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 11 [2023-11-30 03:45:59,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 12 treesize of output 8 [2023-11-30 03:46:00,111 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-30 03:46:00,167 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-30 03:46:00,244 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-30 03:46:00,350 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-30 03:46:00,503 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-30 03:46:00,508 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-30 03:46:00,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:00,597 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-30 03:46:00,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:00,620 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-30 03:46:00,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:00,642 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-30 03:46:00,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:00,669 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-30 03:46:00,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:00,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:00,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:00,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:00,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:46:00,767 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 58 treesize of output 47 [2023-11-30 03:46:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:46:00,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:46:04,809 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_66| Int)) (or (forall ((v_ArrVal_3407 Int) (v_ArrVal_3406 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3406))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_66| .cse2) v_ArrVal_3407))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_66| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_66| Int)) (or (forall ((v_ArrVal_3407 Int) (v_ArrVal_3406 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3406))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_66| .cse2) v_ArrVal_3407))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_66| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_66| Int)) (or (forall ((v_ArrVal_3407 Int) (v_ArrVal_3406 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3406))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_66| .cse2) v_ArrVal_3407))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_66| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_66| Int)) (or (forall ((v_ArrVal_3407 Int) (v_ArrVal_3406 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3406))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_66| .cse2) v_ArrVal_3407))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_66| .cse3))))) is different from false [2023-11-30 03:46:20,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:46:20,019 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 81 treesize of output 74 [2023-11-30 03:46:20,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:46:20,031 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 444 treesize of output 416 [2023-11-30 03:46:20,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 190 treesize of output 174 [2023-11-30 03:46:20,048 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 31 treesize of output 17 [2023-11-30 03:46:20,071 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 149 treesize of output 127 [2023-11-30 03:46:20,204 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:46:20,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2023-11-30 03:46:20,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:46:20,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-30 03:46:20,230 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:46:20,240 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-30 03:46:20,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130 [2023-11-30 03:46:20,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-11-30 03:46:20,255 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 80 treesize of output 62 [2023-11-30 03:46:20,274 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:46:20,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-30 03:46:27,305 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 70 treesize of output 62 [2023-11-30 03:46:27,481 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3394 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3394))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#is~0#1.base| .cse0)) (forall ((v_ArrVal_3395 (Array Int Int))) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse1 .cse0 v_ArrVal_3395) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (forall ((v_ArrVal_3394 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3394) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-30 03:46:27,527 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_3394 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3394))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|)) (forall ((v_ArrVal_3395 (Array Int Int))) (not (= (select (select (store .cse1 .cse0 v_ArrVal_3395) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (forall ((v_ArrVal_3394 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3394) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false [2023-11-30 03:46:28,249 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-30 03:46:28,250 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 704 treesize of output 443 [2023-11-30 03:46:28,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:46:28,269 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 131 treesize of output 127 [2023-11-30 03:46:28,276 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 100 treesize of output 94 [2023-11-30 03:46:28,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-30 03:46:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:46:28,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036000818] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:46:28,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:46:28,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 63 [2023-11-30 03:46:28,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400549993] [2023-11-30 03:46:28,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:46:28,529 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-11-30 03:46:28,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:46:28,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-11-30 03:46:28,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=3342, Unknown=59, NotChecked=360, Total=4032 [2023-11-30 03:46:28,531 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:46:28,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 971 places, 5255 transitions, 243712 flow. Second operand has 64 states, 64 states have (on average 40.65625) internal successors, (2602), 64 states have internal predecessors, (2602), 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-30 03:46:28,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:46:28,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:46:28,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:46:58,200 INFO L124 PetriNetUnfolderBase]: 2689/12723 cut-off events. [2023-11-30 03:46:58,200 INFO L125 PetriNetUnfolderBase]: For 216768/216816 co-relation queries the response was YES. [2023-11-30 03:46:58,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212153 conditions, 12723 events. 2689/12723 cut-off events. For 216768/216816 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 152435 event pairs, 98 based on Foata normal form. 6/12442 useless extension candidates. Maximal degree in co-relation 190465. Up to 6855 conditions per place. [2023-11-30 03:46:58,335 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 2993 selfloop transitions, 867 changer transitions 1701/5583 dead transitions. [2023-11-30 03:46:58,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1010 places, 5583 transitions, 269914 flow [2023-11-30 03:46:58,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-30 03:46:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-11-30 03:46:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 1866 transitions. [2023-11-30 03:46:58,337 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.34301470588235294 [2023-11-30 03:46:58,337 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 1866 transitions. [2023-11-30 03:46:58,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 1866 transitions. [2023-11-30 03:46:58,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:46:58,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 1866 transitions. [2023-11-30 03:46:58,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 46.65) internal successors, (1866), 40 states have internal predecessors, (1866), 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-30 03:46:58,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 136.0) internal successors, (5576), 41 states have internal predecessors, (5576), 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-30 03:46:58,359 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 136.0) internal successors, (5576), 41 states have internal predecessors, (5576), 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-30 03:46:58,359 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 875 predicate places. [2023-11-30 03:46:58,360 INFO L500 AbstractCegarLoop]: Abstraction has has 1010 places, 5583 transitions, 269914 flow [2023-11-30 03:46:58,360 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 40.65625) internal successors, (2602), 64 states have internal predecessors, (2602), 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-30 03:46:58,372 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:46:58,372 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:46:58,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-30 03:46:58,578 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:46:58,578 INFO L425 AbstractCegarLoop]: === Iteration 26 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:46:58,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:46:58,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1398833605, now seen corresponding path program 20 times [2023-11-30 03:46:58,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:46:58,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242919127] [2023-11-30 03:46:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:58,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:46:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:47:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:47:01,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:47:01,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242919127] [2023-11-30 03:47:01,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242919127] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:47:01,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051242894] [2023-11-30 03:47:01,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 03:47:01,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:47:01,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:47:01,938 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:47:01,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-30 03:47:02,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 03:47:02,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:47:02,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-30 03:47:02,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:47:02,640 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-30 03:47:02,641 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-30 03:47:03,175 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:47:03,175 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 76 treesize of output 70 [2023-11-30 03:47:03,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:03,183 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 24 treesize of output 11 [2023-11-30 03:47:03,770 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-30 03:47:03,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 21 treesize of output 20 [2023-11-30 03:47:03,978 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-30 03:47:04,099 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-30 03:47:04,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:04,111 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-30 03:47:04,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:04,188 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-30 03:47:04,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:04,207 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-30 03:47:04,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:04,223 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-30 03:47:04,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:04,238 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-30 03:47:04,333 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-30 03:47:04,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:04,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:04,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:04,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:04,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:04,439 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 58 treesize of output 47 [2023-11-30 03:47:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:47:04,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:47:04,786 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false [2023-11-30 03:47:04,854 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_69| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse0) (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse1 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse3) v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_69| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse0) (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse3) v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_69| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse3) v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_69| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse3) v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse0))))) is different from false [2023-11-30 03:47:04,905 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_69| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse2) v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_69| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse5) (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse2) v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_69| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse5) (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse2) v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_69| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse5) (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse2) v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0))))))) is different from false [2023-11-30 03:47:04,943 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse6 0))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_69| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse0) (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse3) v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_69| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse0) (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse3) v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_69| Int)) (or (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse3) v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_69| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse0) (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3574 Int)) (= (select (select (let ((.cse10 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3572) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_69| .cse3) v_ArrVal_3574))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))))) is different from false [2023-11-30 03:47:04,985 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-30 03:47:04,985 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 348 treesize of output 284 [2023-11-30 03:47:05,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:05,002 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 228 treesize of output 224 [2023-11-30 03:47:05,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 206 treesize of output 198 [2023-11-30 03:47:05,055 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:47:05,073 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-30 03:47:05,073 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 364 treesize of output 273 [2023-11-30 03:47:05,077 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:47:05,079 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 133 treesize of output 123 [2023-11-30 03:47:05,098 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:47:05,115 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-30 03:47:05,116 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 240 treesize of output 221 [2023-11-30 03:47:05,119 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:47:05,121 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 97 treesize of output 91 [2023-11-30 03:47:05,139 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:47:05,146 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-30 03:47:05,146 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 364 treesize of output 1 [2023-11-30 03:47:05,791 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 70 treesize of output 62 [2023-11-30 03:47:05,908 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3561 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3561) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_3561 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3561))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#is~0#1.base| .cse0)) (forall ((v_ArrVal_3562 (Array Int Int))) (not (= (select (select (store .cse1 .cse0 v_ArrVal_3562) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))))) is different from false [2023-11-30 03:47:05,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_71| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_71|) (forall ((v_ArrVal_3561 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_71| v_ArrVal_3561))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_3562 (Array Int Int))) (not (= (select (select (store .cse1 .cse2 v_ArrVal_3562) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| .cse2)))))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_71| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_71|) (forall ((v_ArrVal_3561 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_71| v_ArrVal_3561) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) is different from false [2023-11-30 03:47:06,296 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 20 treesize of output 18 [2023-11-30 03:47:06,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:06,425 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-30 03:47:06,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2023-11-30 03:47:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:47:06,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051242894] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:47:06,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:47:06,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 24] total 68 [2023-11-30 03:47:06,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745442381] [2023-11-30 03:47:06,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:47:06,571 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-30 03:47:06,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:47:06,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-30 03:47:06,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3673, Unknown=11, NotChecked=762, Total=4692 [2023-11-30 03:47:06,574 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:47:06,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1010 places, 5583 transitions, 269914 flow. Second operand has 69 states, 69 states have (on average 40.56521739130435) internal successors, (2799), 69 states have internal predecessors, (2799), 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-30 03:47:06,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:47:06,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:47:06,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:47:38,526 INFO L124 PetriNetUnfolderBase]: 2750/13008 cut-off events. [2023-11-30 03:47:38,526 INFO L125 PetriNetUnfolderBase]: For 241056/241106 co-relation queries the response was YES. [2023-11-30 03:47:38,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225242 conditions, 13008 events. 2750/13008 cut-off events. For 241056/241106 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 156760 event pairs, 99 based on Foata normal form. 6/12724 useless extension candidates. Maximal degree in co-relation 202684. Up to 7000 conditions per place. [2023-11-30 03:47:38,636 INFO L140 encePairwiseOnDemand]: 101/136 looper letters, 3088 selfloop transitions, 895 changer transitions 1701/5706 dead transitions. [2023-11-30 03:47:38,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1051 places, 5706 transitions, 287314 flow [2023-11-30 03:47:38,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-30 03:47:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-30 03:47:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 1970 transitions. [2023-11-30 03:47:38,638 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3448879551820728 [2023-11-30 03:47:38,638 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 1970 transitions. [2023-11-30 03:47:38,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 1970 transitions. [2023-11-30 03:47:38,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:47:38,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 1970 transitions. [2023-11-30 03:47:38,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 46.904761904761905) internal successors, (1970), 42 states have internal predecessors, (1970), 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-30 03:47:38,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 136.0) internal successors, (5848), 43 states have internal predecessors, (5848), 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-30 03:47:38,642 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 136.0) internal successors, (5848), 43 states have internal predecessors, (5848), 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-30 03:47:38,643 INFO L307 CegarLoopForPetriNet]: 135 programPoint places, 916 predicate places. [2023-11-30 03:47:38,643 INFO L500 AbstractCegarLoop]: Abstraction has has 1051 places, 5706 transitions, 287314 flow [2023-11-30 03:47:38,643 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 40.56521739130435) internal successors, (2799), 69 states have internal predecessors, (2799), 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-30 03:47:38,643 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:47:38,643 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:47:38,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-30 03:47:38,843 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-30 03:47:38,844 INFO L425 AbstractCegarLoop]: === Iteration 27 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:47:38,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:47:38,844 INFO L85 PathProgramCache]: Analyzing trace with hash -854020539, now seen corresponding path program 21 times [2023-11-30 03:47:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:47:38,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975942567] [2023-11-30 03:47:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:47:38,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:47:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:47:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:47:40,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:47:40,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975942567] [2023-11-30 03:47:40,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975942567] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:47:40,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616830873] [2023-11-30 03:47:40,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 03:47:40,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:47:40,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:47:40,387 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:47:40,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-30 03:47:40,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-30 03:47:40,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:47:40,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-30 03:47:40,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:47:41,346 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-30 03:47:41,346 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-30 03:47:41,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:41,359 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-30 03:47:42,056 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-30 03:47:42,056 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 76 treesize of output 70 [2023-11-30 03:47:42,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:42,071 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 24 treesize of output 11 [2023-11-30 03:47:42,736 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-30 03:47:42,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:47:42,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:42,933 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 35 [2023-11-30 03:47:42,941 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-30 03:47:43,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:43,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:47:43,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:43,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:47:43,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:43,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:47:43,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:43,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 03:47:43,118 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 26 treesize of output 28 [2023-11-30 03:47:43,178 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 33 treesize of output 38 [2023-11-30 03:47:43,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:43,274 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 44 treesize of output 41 [2023-11-30 03:47:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:47:43,326 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:47:45,150 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (and (forall ((v_ArrVal_3742 Int) (v_ArrVal_3738 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3738) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3738) c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse5 0)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3742))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (forall ((v_ArrVal_3742 Int) (v_ArrVal_3738 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3738) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3738) c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse5 0)))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 v_ArrVal_3742))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_3742 Int) (v_ArrVal_3738 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3738) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3738) c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse5 0)))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 v_ArrVal_3742))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (forall ((v_ArrVal_3742 Int) (v_ArrVal_3738 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3738) c_threadThread1of1ForFork0_~p~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3738) c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse5 0)))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 v_ArrVal_3742))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0))))) is different from false [2023-11-30 03:47:45,175 INFO L349 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2023-11-30 03:47:45,175 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 530 treesize of output 484 [2023-11-30 03:47:45,182 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 168 treesize of output 162 [2023-11-30 03:47:45,240 INFO L349 Elim1Store]: treesize reduction 26, result has 63.9 percent of original size [2023-11-30 03:47:45,240 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 706 treesize of output 583 [2023-11-30 03:47:45,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:45,255 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 259 treesize of output 255 [2023-11-30 03:47:45,264 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 230 treesize of output 222 [2023-11-30 03:47:45,344 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:47:45,364 INFO L349 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2023-11-30 03:47:45,364 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 738 treesize of output 588 [2023-11-30 03:47:45,368 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:47:45,371 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 146 treesize of output 136 [2023-11-30 03:47:45,386 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:47:45,409 INFO L349 Elim1Store]: treesize reduction 49, result has 31.9 percent of original size [2023-11-30 03:47:45,409 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 530 treesize of output 488 [2023-11-30 03:47:45,413 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 03:47:45,415 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 86 [2023-11-30 03:47:47,575 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3728 (Array Int Int)) (v_ArrVal_3729 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3729))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_3730 (Array Int Int))) (not (= (select (select (store .cse0 .cse1 v_ArrVal_3730) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_3731 (Array Int Int))) (not (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3728))) (= (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_3731) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))))) (forall ((v_ArrVal_3728 (Array Int Int)) (v_ArrVal_3729 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3729))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_3731 (Array Int Int))) (not (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3728))) (= (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ 2 (select (select (store .cse3 .cse4 v_ArrVal_3731) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) (forall ((v_ArrVal_3730 (Array Int Int))) (not (= (select (select (store .cse5 .cse4 v_ArrVal_3730) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse5 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (forall ((v_ArrVal_3728 (Array Int Int)) (v_ArrVal_3729 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3729))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_3730 (Array Int Int))) (not (= (select (select (store .cse6 .cse7 v_ArrVal_3730) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse6 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_3731 (Array Int Int))) (not (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3728))) (= (select (select .cse8 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ 3 (select (select (store .cse8 .cse7 v_ArrVal_3731) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) (forall ((v_ArrVal_3729 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3729) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_3728 (Array Int Int)) (v_ArrVal_3729 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3729))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_3730 (Array Int Int))) (not (= (select (select (store .cse9 .cse10 v_ArrVal_3730) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse9 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_3731 (Array Int Int))) (not (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3728))) (= (select (select .cse11 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse11 .cse10 v_ArrVal_3731) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 4)))))))))) is different from false [2023-11-30 03:47:47,747 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_74| Int)) (or (forall ((v_ArrVal_3728 (Array Int Int)) (v_ArrVal_3729 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_74| v_ArrVal_3729))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_3730 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_3730) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_3731 (Array Int Int))) (not (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_74| v_ArrVal_3728))) (= (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ 3 (select (select (store .cse2 .cse1 v_ArrVal_3731) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) (< .cse3 |v_ULTIMATE.start_main_#t~mem8#1.base_74|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_74| Int)) (or (forall ((v_ArrVal_3728 (Array Int Int)) (v_ArrVal_3729 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_74| v_ArrVal_3729))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_3730 (Array Int Int))) (not (= (select (select .cse4 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse4 .cse5 v_ArrVal_3730) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_3731 (Array Int Int))) (not (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_74| v_ArrVal_3728))) (= (select (select .cse6 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ 2 (select (select (store .cse6 .cse5 v_ArrVal_3731) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) (< .cse3 |v_ULTIMATE.start_main_#t~mem8#1.base_74|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_74| Int)) (or (forall ((v_ArrVal_3729 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_74| v_ArrVal_3729) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (< .cse3 |v_ULTIMATE.start_main_#t~mem8#1.base_74|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_74| Int)) (or (< .cse3 |v_ULTIMATE.start_main_#t~mem8#1.base_74|) (forall ((v_ArrVal_3728 (Array Int Int)) (v_ArrVal_3729 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_74| v_ArrVal_3729))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_3730 (Array Int Int))) (not (= (select (select .cse7 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse7 .cse8 v_ArrVal_3730) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_3731 (Array Int Int))) (not (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_74| v_ArrVal_3728))) (= (select (select .cse9 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ 4 (select (select (store .cse9 .cse8 v_ArrVal_3731) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_74| Int)) (or (< .cse3 |v_ULTIMATE.start_main_#t~mem8#1.base_74|) (forall ((v_ArrVal_3728 (Array Int Int)) (v_ArrVal_3729 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_74| v_ArrVal_3729))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_3730 (Array Int Int))) (not (= (select (select .cse10 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse10 .cse11 v_ArrVal_3730) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_3731 (Array Int Int))) (not (let ((.cse12 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_74| v_ArrVal_3728))) (= (select (select .cse12 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse12 .cse11 v_ArrVal_3731) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))))))))) is different from false [2023-11-30 03:47:47,886 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 1373 treesize of output 1257 [2023-11-30 03:47:47,897 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 50 treesize of output 46 [2023-11-30 03:47:47,900 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 44 [2023-11-30 03:47:47,917 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 50 treesize of output 46 [2023-11-30 03:47:47,921 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 44 [2023-11-30 03:47:47,941 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 50 treesize of output 46 [2023-11-30 03:47:47,945 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 44 [2023-11-30 03:47:47,971 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 50 treesize of output 46 [2023-11-30 03:47:47,976 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 44 [2023-11-30 03:47:48,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-30 03:47:48,418 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 20 treesize of output 18 [2023-11-30 03:47:48,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-30 03:47:48,440 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 20 treesize of output 18 [2023-11-30 03:47:48,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:48,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 362 treesize of output 409 [2023-11-30 03:47:48,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:48,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 269 treesize of output 265 [2023-11-30 03:47:48,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:48,915 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 265 treesize of output 261 [2023-11-30 03:47:48,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:48,959 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 261 treesize of output 257 [2023-11-30 03:47:49,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:49,000 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 257 treesize of output 253 [2023-11-30 03:47:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-30 03:47:50,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616830873] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:47:50,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:47:50,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 71 [2023-11-30 03:47:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942127572] [2023-11-30 03:47:50,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:47:50,619 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-30 03:47:50,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:47:50,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-30 03:47:50,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=4332, Unknown=65, NotChecked=408, Total=5112 [2023-11-30 03:47:50,621 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-30 03:47:50,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1051 places, 5706 transitions, 287314 flow. Second operand has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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-30 03:47:50,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:47:50,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-30 03:47:50,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-30 03:47:59,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-30 03:47:59,712 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr0ASSERT_VIOLATIONDATA_RACE (10 of 11 remaining) [2023-11-30 03:47:59,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-30 03:47:59,733 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 03:47:59,750 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 03:47:59,912 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-30 03:47:59,913 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (72states, 38/136 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 4344 conditions, 208 events (44/207 cut-off events. For 3754/3758 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 676 event pairs, 0 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 2728. Up to 95 conditions per place.). [2023-11-30 03:47:59,915 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2023-11-30 03:47:59,915 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2023-11-30 03:47:59,915 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2023-11-30 03:47:59,915 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2023-11-30 03:47:59,915 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2023-11-30 03:47:59,915 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2023-11-30 03:47:59,916 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2023-11-30 03:47:59,916 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2023-11-30 03:47:59,916 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 11 remaining) [2023-11-30 03:47:59,916 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2023-11-30 03:47:59,916 INFO L457 BasicCegarLoop]: Path program histogram: [21, 1, 1, 1, 1, 1, 1] [2023-11-30 03:47:59,923 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:47:59,923 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:47:59,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:47:59 BasicIcfg [2023-11-30 03:47:59,934 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:47:59,934 INFO L158 Benchmark]: Toolchain (without parser) took 822580.18ms. Allocated memory was 379.6MB in the beginning and 2.7GB in the end (delta: 2.3GB). Free memory was 335.3MB in the beginning and 686.1MB in the end (delta: -350.8MB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2023-11-30 03:47:59,934 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 379.6MB. Free memory is still 330.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:47:59,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.59ms. Allocated memory is still 379.6MB. Free memory was 334.9MB in the beginning and 306.9MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-11-30 03:47:59,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.46ms. Allocated memory is still 379.6MB. Free memory was 306.9MB in the beginning and 304.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:47:59,935 INFO L158 Benchmark]: Boogie Preprocessor took 30.81ms. Allocated memory is still 379.6MB. Free memory was 304.2MB in the beginning and 301.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:47:59,935 INFO L158 Benchmark]: RCFGBuilder took 457.98ms. Allocated memory was 379.6MB in the beginning and 704.6MB in the end (delta: 325.1MB). Free memory was 301.4MB in the beginning and 669.0MB in the end (delta: -367.6MB). Peak memory consumption was 28.4MB. Max. memory is 16.0GB. [2023-11-30 03:47:59,935 INFO L158 Benchmark]: TraceAbstraction took 821560.10ms. Allocated memory was 704.6MB in the beginning and 2.7GB in the end (delta: 2.0GB). Free memory was 668.0MB in the beginning and 686.1MB in the end (delta: -18.1MB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2023-11-30 03:47:59,936 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.12ms. Allocated memory is still 379.6MB. Free memory is still 330.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 470.59ms. Allocated memory is still 379.6MB. Free memory was 334.9MB in the beginning and 306.9MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.46ms. Allocated memory is still 379.6MB. Free memory was 306.9MB in the beginning and 304.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.81ms. Allocated memory is still 379.6MB. Free memory was 304.2MB in the beginning and 301.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 457.98ms. Allocated memory was 379.6MB in the beginning and 704.6MB in the end (delta: 325.1MB). Free memory was 301.4MB in the beginning and 669.0MB in the end (delta: -367.6MB). Peak memory consumption was 28.4MB. Max. memory is 16.0GB. * TraceAbstraction took 821560.10ms. Allocated memory was 704.6MB in the beginning and 2.7GB in the end (delta: 2.0GB). Free memory was 668.0MB in the beginning and 686.1MB in the end (delta: -18.1MB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (72states, 38/136 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 4344 conditions, 208 events (44/207 cut-off events. For 3754/3758 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 676 event pairs, 0 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 2728. Up to 95 conditions per place.). - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (72states, 38/136 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 4344 conditions, 208 events (44/207 cut-off events. For 3754/3758 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 676 event pairs, 0 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 2728. Up to 95 conditions per place.). - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (72states, 38/136 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 4344 conditions, 208 events (44/207 cut-off events. For 3754/3758 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 676 event pairs, 0 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 2728. Up to 95 conditions per place.). - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (72states, 38/136 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 4344 conditions, 208 events (44/207 cut-off events. For 3754/3758 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 676 event pairs, 0 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 2728. Up to 95 conditions per place.). - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (72states, 38/136 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 4344 conditions, 208 events (44/207 cut-off events. For 3754/3758 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 676 event pairs, 0 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 2728. Up to 95 conditions per place.). - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (72states, 38/136 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 4344 conditions, 208 events (44/207 cut-off events. For 3754/3758 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 676 event pairs, 0 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 2728. Up to 95 conditions per place.). - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (72states, 38/136 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 4344 conditions, 208 events (44/207 cut-off events. For 3754/3758 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 676 event pairs, 0 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 2728. Up to 95 conditions per place.). - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (72states, 38/136 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 4344 conditions, 208 events (44/207 cut-off events. For 3754/3758 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 676 event pairs, 0 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 2728. Up to 95 conditions per place.). - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (72states, 38/136 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 4344 conditions, 208 events (44/207 cut-off events. For 3754/3758 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 676 event pairs, 0 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 2728. Up to 95 conditions per place.). - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (72states, 38/136 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 4344 conditions, 208 events (44/207 cut-off events. For 3754/3758 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 676 event pairs, 0 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 2728. Up to 95 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 147 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 821.4s, OverallIterations: 27, TraceHistogramMax: 2, PathProgramHistogramMax: 21, EmptinessCheckTime: 0.0s, AutomataDifference: 433.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 15935 SdHoareTripleChecker+Valid, 174.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15935 mSDsluCounter, 27022 SdHoareTripleChecker+Invalid, 160.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 47730 IncrementalHoareTripleChecker+Unchecked, 25675 mSDsCounter, 4051 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124645 IncrementalHoareTripleChecker+Invalid, 176432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4051 mSolverCounterUnsat, 1347 mSDtfsCounter, 124645 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4970 GetRequests, 2486 SyntacticMatches, 192 SemanticMatches, 2292 ConstructedPredicates, 131 IntricatePredicates, 1 DeprecatedPredicates, 66318 ImplicationChecksByTransitivity, 406.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287314occurred in iteration=26, InterpolantAutomatonStates: 949, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 376.5s InterpolantComputationTime, 3635 NumberOfCodeBlocks, 3635 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 5246 ConstructedInterpolants, 1513 QuantifiedInterpolants, 246792 SizeOfPredicates, 587 NumberOfNonLiveVariables, 6489 ConjunctsInSsa, 1367 ConjunctsInUnsatCore, 69 InterpolantComputations, 6 PerfectInterpolantSequences, 1/631 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown