/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-struct.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:46:22,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:46:22,777 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:46:22,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:46:22,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:46:22,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:46:22,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:46:22,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:46:22,811 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:46:22,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:46:22,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:46:22,816 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:46:22,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:46:22,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:46:22,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:46:22,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:46:22,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:46:22,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:46:22,818 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:46:22,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:46:22,818 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:46:22,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:46:22,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:46:22,819 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:46:22,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:46:22,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:46:22,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:46:22,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:46:22,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:46:22,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:46:22,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:46:22,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:46:22,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:46:22,822 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:46:22,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:46:22,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:46:22,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:46:23,000 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:46:23,000 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:46:23,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct.i [2023-11-30 03:46:24,104 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:46:24,293 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:46:24,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-struct.i [2023-11-30 03:46:24,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/454c0f980/60a80e78b598482d80fa612f6d2519d3/FLAGdfc39b222 [2023-11-30 03:46:24,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/454c0f980/60a80e78b598482d80fa612f6d2519d3 [2023-11-30 03:46:24,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:46:24,322 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:46:24,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:46:24,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:46:24,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:46:24,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:46:24" (1/1) ... [2023-11-30 03:46:24,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47165ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:46:24, skipping insertion in model container [2023-11-30 03:46:24,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:46:24" (1/1) ... [2023-11-30 03:46:24,369 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:46:24,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:46:24,673 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:46:24,735 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:46:24,774 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:46:24,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:46:24 WrapperNode [2023-11-30 03:46:24,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:46:24,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:46:24,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:46:24,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:46:24,779 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:46:24" (1/1) ... [2023-11-30 03:46:24,808 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:46:24" (1/1) ... [2023-11-30 03:46:24,834 INFO L138 Inliner]: procedures = 265, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2023-11-30 03:46:24,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:46:24,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:46:24,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:46:24,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:46:24,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:46:24" (1/1) ... [2023-11-30 03:46:24,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:46:24" (1/1) ... [2023-11-30 03:46:24,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:46:24" (1/1) ... [2023-11-30 03:46:24,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:46:24" (1/1) ... [2023-11-30 03:46:24,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:46:24" (1/1) ... [2023-11-30 03:46:24,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:46:24" (1/1) ... [2023-11-30 03:46:24,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:46:24" (1/1) ... [2023-11-30 03:46:24,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:46:24" (1/1) ... [2023-11-30 03:46:24,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:46:24,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:46:24,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:46:24,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:46:24,866 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:46:24" (1/1) ... [2023-11-30 03:46:24,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:46:24,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:46:24,893 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:46:24,914 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:46:24,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:46:24,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-30 03:46:24,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:46:24,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-30 03:46:24,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:46:24,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:46:24,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 03:46:24,933 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-30 03:46:24,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-30 03:46:24,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:46:24,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:46:24,934 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:46:25,041 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:46:25,043 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:46:25,198 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:46:25,205 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:46:25,205 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 03:46:25,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:46:25 BoogieIcfgContainer [2023-11-30 03:46:25,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:46:25,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:46:25,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:46:25,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:46:25,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:46:24" (1/3) ... [2023-11-30 03:46:25,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4e5824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:46:25, skipping insertion in model container [2023-11-30 03:46:25,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:46:24" (2/3) ... [2023-11-30 03:46:25,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4e5824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:46:25, skipping insertion in model container [2023-11-30 03:46:25,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:46:25" (3/3) ... [2023-11-30 03:46:25,214 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct.i [2023-11-30 03:46:25,227 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:46:25,227 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-11-30 03:46:25,227 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:46:25,304 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-30 03:46:25,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 213 flow [2023-11-30 03:46:25,403 INFO L124 PetriNetUnfolderBase]: 6/154 cut-off events. [2023-11-30 03:46:25,403 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 03:46:25,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 154 events. 6/154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 301 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. [2023-11-30 03:46:25,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 103 transitions, 213 flow [2023-11-30 03:46:25,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 103 transitions, 213 flow [2023-11-30 03:46:25,426 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:46:25,433 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;@3828edb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:46:25,433 INFO L363 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-30 03:46:25,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:46:25,440 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2023-11-30 03:46:25,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:46:25,441 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:46:25,441 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] [2023-11-30 03:46:25,442 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-30 03:46:25,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:46:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1890511453, now seen corresponding path program 1 times [2023-11-30 03:46:25,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:46:25,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840533020] [2023-11-30 03:46:25,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:25,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:46:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:46:25,767 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:46:25,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:46:25,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840533020] [2023-11-30 03:46:25,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840533020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:46:25,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:46:25,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:46:25,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369449719] [2023-11-30 03:46:25,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:46:25,778 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 03:46:25,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:46:25,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 03:46:25,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 03:46:25,814 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 103 [2023-11-30 03:46:25,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 103 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 0 states have call successors, (0), 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:25,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:46:25,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 103 [2023-11-30 03:46:25,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:46:25,929 INFO L124 PetriNetUnfolderBase]: 1/165 cut-off events. [2023-11-30 03:46:25,930 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 03:46:25,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 165 events. 1/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs, 0 based on Foata normal form. 1/151 useless extension candidates. Maximal degree in co-relation 49. Up to 37 conditions per place. [2023-11-30 03:46:25,932 INFO L140 encePairwiseOnDemand]: 92/103 looper letters, 28 selfloop transitions, 6 changer transitions 2/108 dead transitions. [2023-11-30 03:46:25,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 108 transitions, 293 flow [2023-11-30 03:46:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:46:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:46:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 479 transitions. [2023-11-30 03:46:25,949 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7750809061488673 [2023-11-30 03:46:25,950 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 479 transitions. [2023-11-30 03:46:25,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 479 transitions. [2023-11-30 03:46:25,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:46:25,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 479 transitions. [2023-11-30 03:46:25,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 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:25,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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:25,966 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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:25,969 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 5 predicate places. [2023-11-30 03:46:25,970 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 108 transitions, 293 flow [2023-11-30 03:46:25,970 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 0 states have call successors, (0), 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:25,971 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:46:25,971 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:46:25,971 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:46:25,971 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-30 03:46:25,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:46:25,972 INFO L85 PathProgramCache]: Analyzing trace with hash -403429756, now seen corresponding path program 1 times [2023-11-30 03:46:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:46:25,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882176324] [2023-11-30 03:46:25,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:25,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:46:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:46:26,370 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:46:26,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:46:26,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882176324] [2023-11-30 03:46:26,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882176324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:46:26,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:46:26,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:46:26,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266766965] [2023-11-30 03:46:26,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:46:26,372 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:46:26,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:46:26,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:46:26,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:46:26,374 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 103 [2023-11-30 03:46:26,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 108 transitions, 293 flow. Second operand has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 0 states have call successors, (0), 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:26,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:46:26,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 103 [2023-11-30 03:46:26,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:46:26,655 INFO L124 PetriNetUnfolderBase]: 278/937 cut-off events. [2023-11-30 03:46:26,656 INFO L125 PetriNetUnfolderBase]: For 48/54 co-relation queries the response was YES. [2023-11-30 03:46:26,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 937 events. 278/937 cut-off events. For 48/54 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5765 event pairs, 34 based on Foata normal form. 0/831 useless extension candidates. Maximal degree in co-relation 1551. Up to 414 conditions per place. [2023-11-30 03:46:26,665 INFO L140 encePairwiseOnDemand]: 80/103 looper letters, 69 selfloop transitions, 29 changer transitions 7/165 dead transitions. [2023-11-30 03:46:26,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 165 transitions, 622 flow [2023-11-30 03:46:26,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:46:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:46:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 455 transitions. [2023-11-30 03:46:26,667 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7362459546925566 [2023-11-30 03:46:26,667 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 455 transitions. [2023-11-30 03:46:26,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 455 transitions. [2023-11-30 03:46:26,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:46:26,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 455 transitions. [2023-11-30 03:46:26,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.83333333333333) internal successors, (455), 6 states have internal predecessors, (455), 0 states have call successors, (0), 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:26,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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:26,670 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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:26,671 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places. [2023-11-30 03:46:26,671 INFO L500 AbstractCegarLoop]: Abstraction has has 112 places, 165 transitions, 622 flow [2023-11-30 03:46:26,671 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 0 states have call successors, (0), 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:26,671 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:46:26,671 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] [2023-11-30 03:46:26,672 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:46:26,672 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-30 03:46:26,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:46:26,673 INFO L85 PathProgramCache]: Analyzing trace with hash -287417092, now seen corresponding path program 1 times [2023-11-30 03:46:26,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:46:26,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068759647] [2023-11-30 03:46:26,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:26,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:46:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:46:26,970 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:46:26,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:46:26,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068759647] [2023-11-30 03:46:26,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068759647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:46:26,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:46:26,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:46:26,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658538792] [2023-11-30 03:46:26,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:46:26,974 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:46:26,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:46:26,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:46:26,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:46:26,976 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 103 [2023-11-30 03:46:26,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 165 transitions, 622 flow. Second operand has 6 states, 6 states have (on average 65.33333333333333) internal successors, (392), 6 states have internal predecessors, (392), 0 states have call successors, (0), 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:26,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:46:26,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 103 [2023-11-30 03:46:26,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:46:27,344 INFO L124 PetriNetUnfolderBase]: 559/1608 cut-off events. [2023-11-30 03:46:27,344 INFO L125 PetriNetUnfolderBase]: For 194/215 co-relation queries the response was YES. [2023-11-30 03:46:27,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4131 conditions, 1608 events. 559/1608 cut-off events. For 194/215 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 11248 event pairs, 111 based on Foata normal form. 2/1462 useless extension candidates. Maximal degree in co-relation 3877. Up to 926 conditions per place. [2023-11-30 03:46:27,349 INFO L140 encePairwiseOnDemand]: 80/103 looper letters, 115 selfloop transitions, 90 changer transitions 17/291 dead transitions. [2023-11-30 03:46:27,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 291 transitions, 1620 flow [2023-11-30 03:46:27,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:46:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:46:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2023-11-30 03:46:27,351 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8365695792880259 [2023-11-30 03:46:27,351 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 517 transitions. [2023-11-30 03:46:27,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 517 transitions. [2023-11-30 03:46:27,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:46:27,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 517 transitions. [2023-11-30 03:46:27,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:46:27,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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:27,354 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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:27,354 INFO L307 CegarLoopForPetriNet]: 102 programPoint places, 15 predicate places. [2023-11-30 03:46:27,354 INFO L500 AbstractCegarLoop]: Abstraction has has 117 places, 291 transitions, 1620 flow [2023-11-30 03:46:27,355 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.33333333333333) internal successors, (392), 6 states have internal predecessors, (392), 0 states have call successors, (0), 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:27,355 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:46:27,355 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2023-11-30 03:46:27,355 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:46:27,355 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-30 03:46:27,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:46:27,355 INFO L85 PathProgramCache]: Analyzing trace with hash -952757084, now seen corresponding path program 1 times [2023-11-30 03:46:27,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:46:27,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166517328] [2023-11-30 03:46:27,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:27,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:46:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 03:46:27,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 03:46:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 03:46:27,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 03:46:27,396 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 03:46:27,396 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-30 03:46:27,397 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-30 03:46:27,397 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-30 03:46:27,398 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-30 03:46:27,398 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-30 03:46:27,398 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-30 03:46:27,398 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-30 03:46:27,398 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:46:27,398 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-30 03:46:27,400 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 03:46:27,400 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 03:46:27,415 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 03:46:27,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 122 transitions, 260 flow [2023-11-30 03:46:27,439 INFO L124 PetriNetUnfolderBase]: 11/275 cut-off events. [2023-11-30 03:46:27,439 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 03:46:27,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 275 events. 11/275 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 619 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 156. Up to 8 conditions per place. [2023-11-30 03:46:27,440 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 122 transitions, 260 flow [2023-11-30 03:46:27,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 122 transitions, 260 flow [2023-11-30 03:46:27,442 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:46:27,442 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;@3828edb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:46:27,442 INFO L363 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-30 03:46:27,444 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:46:27,444 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2023-11-30 03:46:27,444 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:46:27,444 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:46:27,445 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] [2023-11-30 03:46:27,445 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-30 03:46:27,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:46:27,445 INFO L85 PathProgramCache]: Analyzing trace with hash 218543447, now seen corresponding path program 1 times [2023-11-30 03:46:27,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:46:27,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49010619] [2023-11-30 03:46:27,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:27,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:46:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:46:27,479 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:46:27,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:46:27,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49010619] [2023-11-30 03:46:27,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49010619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:46:27,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:46:27,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:46:27,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010886467] [2023-11-30 03:46:27,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:46:27,480 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 03:46:27,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:46:27,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 03:46:27,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 03:46:27,481 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 122 [2023-11-30 03:46:27,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 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:27,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:46:27,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 122 [2023-11-30 03:46:27,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:46:27,531 INFO L124 PetriNetUnfolderBase]: 3/283 cut-off events. [2023-11-30 03:46:27,531 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 03:46:27,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 283 events. 3/283 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 683 event pairs, 0 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 213. Up to 74 conditions per place. [2023-11-30 03:46:27,532 INFO L140 encePairwiseOnDemand]: 111/122 looper letters, 32 selfloop transitions, 6 changer transitions 2/129 dead transitions. [2023-11-30 03:46:27,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 129 transitions, 352 flow [2023-11-30 03:46:27,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:46:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:46:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2023-11-30 03:46:27,533 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7991803278688525 [2023-11-30 03:46:27,533 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 585 transitions. [2023-11-30 03:46:27,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 585 transitions. [2023-11-30 03:46:27,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:46:27,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 585 transitions. [2023-11-30 03:46:27,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 0 states have call successors, (0), 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:27,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 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:27,536 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 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:27,537 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 5 predicate places. [2023-11-30 03:46:27,537 INFO L500 AbstractCegarLoop]: Abstraction has has 127 places, 129 transitions, 352 flow [2023-11-30 03:46:27,537 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 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:27,537 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:46:27,537 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:46:27,537 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:46:27,537 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-30 03:46:27,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:46:27,538 INFO L85 PathProgramCache]: Analyzing trace with hash -694830268, now seen corresponding path program 1 times [2023-11-30 03:46:27,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:46:27,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813412221] [2023-11-30 03:46:27,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:27,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:46:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:46:27,642 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:46:27,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:46:27,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813412221] [2023-11-30 03:46:27,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813412221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:46:27,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:46:27,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:46:27,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319893445] [2023-11-30 03:46:27,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:46:27,643 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:46:27,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:46:27,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:46:27,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:46:27,644 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 122 [2023-11-30 03:46:27,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 129 transitions, 352 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 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:27,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:46:27,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 122 [2023-11-30 03:46:27,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:46:28,528 INFO L124 PetriNetUnfolderBase]: 5081/11004 cut-off events. [2023-11-30 03:46:28,528 INFO L125 PetriNetUnfolderBase]: For 603/669 co-relation queries the response was YES. [2023-11-30 03:46:28,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20783 conditions, 11004 events. 5081/11004 cut-off events. For 603/669 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 91537 event pairs, 1179 based on Foata normal form. 0/9704 useless extension candidates. Maximal degree in co-relation 12764. Up to 5949 conditions per place. [2023-11-30 03:46:28,573 INFO L140 encePairwiseOnDemand]: 95/122 looper letters, 87 selfloop transitions, 48 changer transitions 7/215 dead transitions. [2023-11-30 03:46:28,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 215 transitions, 825 flow [2023-11-30 03:46:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:46:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:46:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 558 transitions. [2023-11-30 03:46:28,574 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7622950819672131 [2023-11-30 03:46:28,574 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 558 transitions. [2023-11-30 03:46:28,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 558 transitions. [2023-11-30 03:46:28,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:46:28,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 558 transitions. [2023-11-30 03:46:28,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 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,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 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,577 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 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,577 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2023-11-30 03:46:28,577 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 215 transitions, 825 flow [2023-11-30 03:46:28,577 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 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,578 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:46:28,578 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] [2023-11-30 03:46:28,578 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:46:28,578 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-30 03:46:28,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:46:28,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2146043957, now seen corresponding path program 1 times [2023-11-30 03:46:28,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:46:28,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543672254] [2023-11-30 03:46:28,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:28,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:46:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:46:28,880 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:46:28,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:46:28,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543672254] [2023-11-30 03:46:28,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543672254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:46:28,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:46:28,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:46:28,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311458036] [2023-11-30 03:46:28,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:46:28,881 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:46:28,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:46:28,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:46:28,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:46:28,883 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 122 [2023-11-30 03:46:28,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 215 transitions, 825 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 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,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:46:28,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 122 [2023-11-30 03:46:28,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:46:31,060 INFO L124 PetriNetUnfolderBase]: 11088/22280 cut-off events. [2023-11-30 03:46:31,061 INFO L125 PetriNetUnfolderBase]: For 2236/2443 co-relation queries the response was YES. [2023-11-30 03:46:31,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57418 conditions, 22280 events. 11088/22280 cut-off events. For 2236/2443 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 199131 event pairs, 2003 based on Foata normal form. 24/19986 useless extension candidates. Maximal degree in co-relation 12251. Up to 14207 conditions per place. [2023-11-30 03:46:31,160 INFO L140 encePairwiseOnDemand]: 95/122 looper letters, 190 selfloop transitions, 162 changer transitions 7/441 dead transitions. [2023-11-30 03:46:31,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 441 transitions, 2578 flow [2023-11-30 03:46:31,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:46:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:46:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions. [2023-11-30 03:46:31,162 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8510928961748634 [2023-11-30 03:46:31,162 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 623 transitions. [2023-11-30 03:46:31,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 623 transitions. [2023-11-30 03:46:31,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:46:31,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 623 transitions. [2023-11-30 03:46:31,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 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:31,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 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:31,165 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 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:31,165 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 15 predicate places. [2023-11-30 03:46:31,165 INFO L500 AbstractCegarLoop]: Abstraction has has 137 places, 441 transitions, 2578 flow [2023-11-30 03:46:31,166 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 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:31,166 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:46:31,166 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] [2023-11-30 03:46:31,166 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:46:31,166 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-30 03:46:31,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:46:31,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2047691668, now seen corresponding path program 1 times [2023-11-30 03:46:31,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:46:31,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752283761] [2023-11-30 03:46:31,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:31,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:46:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:46:31,434 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:46:31,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:46:31,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752283761] [2023-11-30 03:46:31,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752283761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:46:31,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:46:31,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:46:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061633288] [2023-11-30 03:46:31,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:46:31,435 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:46:31,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:46:31,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:46:31,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:46:31,437 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 122 [2023-11-30 03:46:31,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 441 transitions, 2578 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 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:31,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:46:31,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 122 [2023-11-30 03:46:31,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:46:33,825 INFO L124 PetriNetUnfolderBase]: 13184/25894 cut-off events. [2023-11-30 03:46:33,825 INFO L125 PetriNetUnfolderBase]: For 6389/7731 co-relation queries the response was YES. [2023-11-30 03:46:33,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84873 conditions, 25894 events. 13184/25894 cut-off events. For 6389/7731 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 229549 event pairs, 2927 based on Foata normal form. 27/23408 useless extension candidates. Maximal degree in co-relation 18758. Up to 16377 conditions per place. [2023-11-30 03:46:33,979 INFO L140 encePairwiseOnDemand]: 107/122 looper letters, 390 selfloop transitions, 139 changer transitions 15/620 dead transitions. [2023-11-30 03:46:33,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 620 transitions, 4772 flow [2023-11-30 03:46:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:46:33,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:46:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 515 transitions. [2023-11-30 03:46:33,982 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.703551912568306 [2023-11-30 03:46:33,982 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 515 transitions. [2023-11-30 03:46:33,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 515 transitions. [2023-11-30 03:46:33,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:46:33,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 515 transitions. [2023-11-30 03:46:33,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 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:33,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 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:33,984 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 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:33,985 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 20 predicate places. [2023-11-30 03:46:33,985 INFO L500 AbstractCegarLoop]: Abstraction has has 142 places, 620 transitions, 4772 flow [2023-11-30 03:46:33,985 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 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:33,986 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:46:33,986 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] [2023-11-30 03:46:33,986 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:46:33,986 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-30 03:46:33,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:46:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1176428366, now seen corresponding path program 1 times [2023-11-30 03:46:33,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:46:33,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390058106] [2023-11-30 03:46:33,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:33,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:46:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:46:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:46:34,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:46:34,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390058106] [2023-11-30 03:46:34,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390058106] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:46:34,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314274173] [2023-11-30 03:46:34,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:34,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:46:34,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:46:34,469 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:46:34,512 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:46:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:46:34,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-30 03:46:34,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:46:34,814 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:34,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-30 03:46:34,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:46:34,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-30 03:46:34,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:46:34,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-30 03:46:34,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:34,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:46:34,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:46:35,030 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_269 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_269 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_269 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_269 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false [2023-11-30 03:46:35,054 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_269 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_269 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_269 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_269 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false [2023-11-30 03:46:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:46:35,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314274173] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:46:35,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:46:35,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 30 [2023-11-30 03:46:35,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231341691] [2023-11-30 03:46:35,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:46:35,246 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-30 03:46:35,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:46:35,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-30 03:46:35,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=716, Unknown=2, NotChecked=110, Total=930 [2023-11-30 03:46:35,248 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 122 [2023-11-30 03:46:35,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 620 transitions, 4772 flow. Second operand has 31 states, 31 states have (on average 56.354838709677416) internal successors, (1747), 31 states have internal predecessors, (1747), 0 states have call successors, (0), 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:35,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:46:35,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 122 [2023-11-30 03:46:35,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:46:42,986 INFO L124 PetriNetUnfolderBase]: 20298/39002 cut-off events. [2023-11-30 03:46:42,986 INFO L125 PetriNetUnfolderBase]: For 31319/32184 co-relation queries the response was YES. [2023-11-30 03:46:43,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153608 conditions, 39002 events. 20298/39002 cut-off events. For 31319/32184 co-relation queries the response was YES. Maximal size of possible extension queue 1252. Compared 354723 event pairs, 1000 based on Foata normal form. 12/35806 useless extension candidates. Maximal degree in co-relation 129395. Up to 23084 conditions per place. [2023-11-30 03:46:43,235 INFO L140 encePairwiseOnDemand]: 94/122 looper letters, 1702 selfloop transitions, 735 changer transitions 119/2614 dead transitions. [2023-11-30 03:46:43,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 2614 transitions, 25092 flow [2023-11-30 03:46:43,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-11-30 03:46:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-11-30 03:46:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 3593 transitions. [2023-11-30 03:46:43,242 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5774670523947284 [2023-11-30 03:46:43,242 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 3593 transitions. [2023-11-30 03:46:43,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 3593 transitions. [2023-11-30 03:46:43,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:46:43,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 3593 transitions. [2023-11-30 03:46:43,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 70.45098039215686) internal successors, (3593), 51 states have internal predecessors, (3593), 0 states have call successors, (0), 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:43,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 122.0) internal successors, (6344), 52 states have internal predecessors, (6344), 0 states have call successors, (0), 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:43,258 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 122.0) internal successors, (6344), 52 states have internal predecessors, (6344), 0 states have call successors, (0), 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:43,259 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 70 predicate places. [2023-11-30 03:46:43,259 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 2614 transitions, 25092 flow [2023-11-30 03:46:43,260 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 56.354838709677416) internal successors, (1747), 31 states have internal predecessors, (1747), 0 states have call successors, (0), 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:43,260 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:46:43,260 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] [2023-11-30 03:46:43,268 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:46:43,469 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:46:43,469 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-30 03:46:43,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:46:43,470 INFO L85 PathProgramCache]: Analyzing trace with hash 417664823, now seen corresponding path program 1 times [2023-11-30 03:46:43,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:46:43,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907714966] [2023-11-30 03:46:43,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:43,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:46:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:46:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:46:43,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:46:43,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907714966] [2023-11-30 03:46:43,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907714966] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:46:43,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733083590] [2023-11-30 03:46:43,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:43,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:46:43,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:46:43,737 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:46:43,752 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:46:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:46:43,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-30 03:46:43,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:46:43,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-30 03:46:44,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:46:44,051 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:46:44,107 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:46:44,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:44,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:46:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:46:44,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:46:44,297 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))))) is different from false [2023-11-30 03:46:44,308 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_348 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_348 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))) (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false [2023-11-30 03:46:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:46:44,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733083590] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:46:44,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:46:44,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2023-11-30 03:46:44,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605195225] [2023-11-30 03:46:44,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:46:44,449 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-30 03:46:44,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:46:44,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-30 03:46:44,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=748, Unknown=12, NotChecked=114, Total=992 [2023-11-30 03:46:44,451 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 122 [2023-11-30 03:46:44,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 2614 transitions, 25092 flow. Second operand has 32 states, 32 states have (on average 62.15625) internal successors, (1989), 32 states have internal predecessors, (1989), 0 states have call successors, (0), 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:44,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:46:44,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 122 [2023-11-30 03:46:44,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:46:55,915 INFO L124 PetriNetUnfolderBase]: 25621/49148 cut-off events. [2023-11-30 03:46:55,916 INFO L125 PetriNetUnfolderBase]: For 52202/53716 co-relation queries the response was YES. [2023-11-30 03:46:56,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230409 conditions, 49148 events. 25621/49148 cut-off events. For 52202/53716 co-relation queries the response was YES. Maximal size of possible extension queue 1620. Compared 459474 event pairs, 1504 based on Foata normal form. 53/45337 useless extension candidates. Maximal degree in co-relation 133502. Up to 29438 conditions per place. [2023-11-30 03:46:56,203 INFO L140 encePairwiseOnDemand]: 91/122 looper letters, 2647 selfloop transitions, 1134 changer transitions 191/4096 dead transitions. [2023-11-30 03:46:56,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 4096 transitions, 47592 flow [2023-11-30 03:46:56,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-30 03:46:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-11-30 03:46:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2392 transitions. [2023-11-30 03:46:56,208 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6127049180327869 [2023-11-30 03:46:56,208 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 2392 transitions. [2023-11-30 03:46:56,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 2392 transitions. [2023-11-30 03:46:56,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:46:56,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2392 transitions. [2023-11-30 03:46:56,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 74.75) internal successors, (2392), 32 states have internal predecessors, (2392), 0 states have call successors, (0), 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:56,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 122.0) internal successors, (4026), 33 states have internal predecessors, (4026), 0 states have call successors, (0), 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:56,217 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 122.0) internal successors, (4026), 33 states have internal predecessors, (4026), 0 states have call successors, (0), 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:56,218 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 101 predicate places. [2023-11-30 03:46:56,218 INFO L500 AbstractCegarLoop]: Abstraction has has 223 places, 4096 transitions, 47592 flow [2023-11-30 03:46:56,218 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 62.15625) internal successors, (1989), 32 states have internal predecessors, (1989), 0 states have call successors, (0), 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:56,218 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:46:56,218 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] [2023-11-30 03:46:56,223 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:46:56,422 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,SelfDestructingSolverStorable9 [2023-11-30 03:46:56,423 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-30 03:46:56,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:46:56,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1953449035, now seen corresponding path program 1 times [2023-11-30 03:46:56,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:46:56,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374589236] [2023-11-30 03:46:56,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:56,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:46:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:46:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:46:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:46:56,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374589236] [2023-11-30 03:46:56,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374589236] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:46:56,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291710444] [2023-11-30 03:46:56,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:46:56,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:46:56,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:46:56,993 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:46:57,008 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:46:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:46:57,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-30 03:46:57,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:46:57,110 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:46:57,176 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:46:57,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-30 03:46:57,293 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-30 03:46:57,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-30 03:46:57,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:57,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-30 03:46:57,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-30 03:46:57,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 25 treesize of output 13 [2023-11-30 03:46:57,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:57,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:46:57,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-30 03:46:57,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:46:57,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-30 03:46:57,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:57,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-30 03:46:57,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:57,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-30 03:46:57,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:57,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-30 03:46:57,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:46:57,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-30 03:46:57,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-30 03:46:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:46:57,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:46:57,844 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_452 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_452 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_452 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_452 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-30 03:46:57,865 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-30 03:46:57,904 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false [2023-11-30 03:46:57,919 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false [2023-11-30 03:46:58,226 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 62 treesize of output 46 [2023-11-30 03:46:58,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:46:58,285 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 35 treesize of output 40 [2023-11-30 03:46:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:46:58,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291710444] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:46:58,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:46:58,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 41 [2023-11-30 03:46:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978237650] [2023-11-30 03:46:58,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:46:58,321 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-30 03:46:58,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:46:58,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-30 03:46:58,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1268, Unknown=7, NotChecked=300, Total=1722 [2023-11-30 03:46:58,324 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 122 [2023-11-30 03:46:58,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 4096 transitions, 47592 flow. Second operand has 42 states, 42 states have (on average 51.19047619047619) internal successors, (2150), 42 states have internal predecessors, (2150), 0 states have call successors, (0), 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,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:46:58,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 122 [2023-11-30 03:46:58,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:47:20,927 INFO L124 PetriNetUnfolderBase]: 31094/60337 cut-off events. [2023-11-30 03:47:20,927 INFO L125 PetriNetUnfolderBase]: For 115891/118003 co-relation queries the response was YES. [2023-11-30 03:47:21,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322128 conditions, 60337 events. 31094/60337 cut-off events. For 115891/118003 co-relation queries the response was YES. Maximal size of possible extension queue 1947. Compared 586817 event pairs, 1484 based on Foata normal form. 152/56089 useless extension candidates. Maximal degree in co-relation 284003. Up to 34145 conditions per place. [2023-11-30 03:47:21,376 INFO L140 encePairwiseOnDemand]: 76/122 looper letters, 4956 selfloop transitions, 888 changer transitions 260/6155 dead transitions. [2023-11-30 03:47:21,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 6155 transitions, 83527 flow [2023-11-30 03:47:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-30 03:47:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-11-30 03:47:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2950 transitions. [2023-11-30 03:47:21,380 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.514475061039414 [2023-11-30 03:47:21,380 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 2950 transitions. [2023-11-30 03:47:21,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 2950 transitions. [2023-11-30 03:47:21,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:47:21,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 2950 transitions. [2023-11-30 03:47:21,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 62.765957446808514) internal successors, (2950), 47 states have internal predecessors, (2950), 0 states have call successors, (0), 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:21,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 122.0) internal successors, (5856), 48 states have internal predecessors, (5856), 0 states have call successors, (0), 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:21,389 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 122.0) internal successors, (5856), 48 states have internal predecessors, (5856), 0 states have call successors, (0), 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:21,389 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 147 predicate places. [2023-11-30 03:47:21,389 INFO L500 AbstractCegarLoop]: Abstraction has has 269 places, 6155 transitions, 83527 flow [2023-11-30 03:47:21,390 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 51.19047619047619) internal successors, (2150), 42 states have internal predecessors, (2150), 0 states have call successors, (0), 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:21,390 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:47:21,390 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] [2023-11-30 03:47:21,408 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:47:21,595 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:47:21,595 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-30 03:47:21,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:47:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1558239095, now seen corresponding path program 2 times [2023-11-30 03:47:21,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:47:21,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356012620] [2023-11-30 03:47:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:47:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:47:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:47:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:47:22,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:47:22,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356012620] [2023-11-30 03:47:22,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356012620] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:47:22,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331532629] [2023-11-30 03:47:22,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 03:47:22,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:47:22,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:47:22,023 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:47:22,026 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:47:22,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 03:47:22,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:47:22,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-30 03:47:22,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:47:22,149 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:47:22,216 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:47:22,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-30 03:47:22,325 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-30 03:47:22,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-30 03:47:22,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:22,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-30 03:47:22,465 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 25 treesize of output 13 [2023-11-30 03:47:22,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-30 03:47:22,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:22,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:22,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-30 03:47:22,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:22,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-30 03:47:22,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:47:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:47:22,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:47:22,536 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_552 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_552) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_552 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_552) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_552 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_552) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_552 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_552) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-30 03:47:22,546 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_552 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_552) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_552 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_552) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_552 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_552) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_552 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_552) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-30 03:47:22,556 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_552 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_552) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_552 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_552) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_552 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_552) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_552 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_552) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false [2023-11-30 03:47:22,604 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_543) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base))) is different from false [2023-11-30 03:47:22,639 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_543) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false [2023-11-30 03:47:22,643 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~t~1#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_543) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false [2023-11-30 03:47:22,689 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_542) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_543) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false [2023-11-30 03:47:22,697 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~malloc8#1.base| (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_542) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_543) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false [2023-11-30 03:47:22,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 57 [2023-11-30 03:47:22,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2023-11-30 03:47:22,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:47:23,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:23,001 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 35 treesize of output 40 [2023-11-30 03:47:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:47:23,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331532629] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:47:23,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:47:23,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 39 [2023-11-30 03:47:23,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647806785] [2023-11-30 03:47:23,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:47:23,027 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-30 03:47:23,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:47:23,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-30 03:47:23,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=880, Unknown=23, NotChecked=536, Total=1560 [2023-11-30 03:47:23,029 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 122 [2023-11-30 03:47:23,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 6155 transitions, 83527 flow. Second operand has 40 states, 40 states have (on average 51.025) internal successors, (2041), 40 states have internal predecessors, (2041), 0 states have call successors, (0), 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:23,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:47:23,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 122 [2023-11-30 03:47:23,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:48:09,985 INFO L124 PetriNetUnfolderBase]: 42968/82350 cut-off events. [2023-11-30 03:48:09,986 INFO L125 PetriNetUnfolderBase]: For 165700/169923 co-relation queries the response was YES. [2023-11-30 03:48:10,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520229 conditions, 82350 events. 42968/82350 cut-off events. For 165700/169923 co-relation queries the response was YES. Maximal size of possible extension queue 2724. Compared 832195 event pairs, 2023 based on Foata normal form. 414/76582 useless extension candidates. Maximal degree in co-relation 466988. Up to 48621 conditions per place. [2023-11-30 03:48:10,846 INFO L140 encePairwiseOnDemand]: 77/122 looper letters, 7007 selfloop transitions, 1553 changer transitions 396/9007 dead transitions. [2023-11-30 03:48:10,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 9007 transitions, 142095 flow [2023-11-30 03:48:10,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-30 03:48:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-30 03:48:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 2649 transitions. [2023-11-30 03:48:10,848 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5169789227166276 [2023-11-30 03:48:10,849 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 2649 transitions. [2023-11-30 03:48:10,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 2649 transitions. [2023-11-30 03:48:10,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:48:10,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 2649 transitions. [2023-11-30 03:48:10,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 63.07142857142857) internal successors, (2649), 42 states have internal predecessors, (2649), 0 states have call successors, (0), 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:48:10,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 122.0) internal successors, (5246), 43 states have internal predecessors, (5246), 0 states have call successors, (0), 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:48:10,857 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 122.0) internal successors, (5246), 43 states have internal predecessors, (5246), 0 states have call successors, (0), 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:48:10,857 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 188 predicate places. [2023-11-30 03:48:10,857 INFO L500 AbstractCegarLoop]: Abstraction has has 310 places, 9007 transitions, 142095 flow [2023-11-30 03:48:10,858 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 51.025) internal successors, (2041), 40 states have internal predecessors, (2041), 0 states have call successors, (0), 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:48:10,858 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:48:10,858 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] [2023-11-30 03:48:10,871 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:48:11,062 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:48:11,065 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-30 03:48:11,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:48:11,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1240229423, now seen corresponding path program 3 times [2023-11-30 03:48:11,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:48:11,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824102575] [2023-11-30 03:48:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:48:11,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:48:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:48:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:48:11,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:48:11,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824102575] [2023-11-30 03:48:11,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824102575] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:48:11,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491782620] [2023-11-30 03:48:11,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 03:48:11,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:48:11,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:48:11,595 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:48:11,597 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:48:11,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-30 03:48:11,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:48:11,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-30 03:48:11,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:48:11,789 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:48:11,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:48:11,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-11-30 03:48:11,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:48:11,908 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-30 03:48:11,908 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:48:12,078 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-30 03:48:12,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-30 03:48:12,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-30 03:48:12,233 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 11 treesize of output 7 [2023-11-30 03:48:12,405 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 19 treesize of output 18 [2023-11-30 03:48:12,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-30 03:48:12,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-30 03:48:12,650 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 25 treesize of output 13 [2023-11-30 03:48:12,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-30 03:48:12,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-30 03:48:12,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-30 03:48:12,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-30 03:48:12,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-30 03:48:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:48:12,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:48:12,885 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_657 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_657 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_657 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_657 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2023-11-30 03:48:12,904 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false [2023-11-30 03:48:12,943 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) .cse0 v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) .cse0 v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) .cse0 v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) .cse0 v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) is different from false [2023-11-30 03:48:12,956 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) .cse1 v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) .cse1 v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) .cse1 v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) .cse1 v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false [2023-11-30 03:48:12,967 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) .cse1 v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) .cse1 v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) .cse1 v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_656) .cse1 v_ArrVal_657) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-30 03:48:13,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 52 treesize of output 40 [2023-11-30 03:48:13,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 22 [2023-11-30 03:48:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:48:13,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491782620] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:48:13,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:48:13,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 20] total 56 [2023-11-30 03:48:13,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797097215] [2023-11-30 03:48:13,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:48:13,894 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-30 03:48:13,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:48:13,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-30 03:48:13,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=2425, Unknown=6, NotChecked=520, Total=3192 [2023-11-30 03:48:13,896 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 122 [2023-11-30 03:48:13,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 9007 transitions, 142095 flow. Second operand has 57 states, 57 states have (on average 35.26315789473684) internal successors, (2010), 57 states have internal predecessors, (2010), 0 states have call successors, (0), 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:48:13,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:48:13,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 122 [2023-11-30 03:48:13,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:49:35,102 INFO L124 PetriNetUnfolderBase]: 45631/87199 cut-off events. [2023-11-30 03:49:35,102 INFO L125 PetriNetUnfolderBase]: For 208536/214099 co-relation queries the response was YES. [2023-11-30 03:49:35,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618970 conditions, 87199 events. 45631/87199 cut-off events. For 208536/214099 co-relation queries the response was YES. Maximal size of possible extension queue 2790. Compared 880749 event pairs, 1336 based on Foata normal form. 571/81399 useless extension candidates. Maximal degree in co-relation 531992. Up to 50642 conditions per place. [2023-11-30 03:49:35,998 INFO L140 encePairwiseOnDemand]: 65/122 looper letters, 7940 selfloop transitions, 1713 changer transitions 439/10127 dead transitions. [2023-11-30 03:49:35,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 10127 transitions, 178217 flow [2023-11-30 03:49:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-30 03:49:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2023-11-30 03:49:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 3316 transitions. [2023-11-30 03:49:36,001 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.37233325847743093 [2023-11-30 03:49:36,001 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 3316 transitions. [2023-11-30 03:49:36,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 3316 transitions. [2023-11-30 03:49:36,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:49:36,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 3316 transitions. [2023-11-30 03:49:36,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 45.42465753424658) internal successors, (3316), 73 states have internal predecessors, (3316), 0 states have call successors, (0), 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:49:36,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 74 states, 74 states have (on average 122.0) internal successors, (9028), 74 states have internal predecessors, (9028), 0 states have call successors, (0), 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:49:36,013 INFO L81 ComplementDD]: Finished complementDD. Result has 74 states, 74 states have (on average 122.0) internal successors, (9028), 74 states have internal predecessors, (9028), 0 states have call successors, (0), 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:49:36,013 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 260 predicate places. [2023-11-30 03:49:36,013 INFO L500 AbstractCegarLoop]: Abstraction has has 382 places, 10127 transitions, 178217 flow [2023-11-30 03:49:36,014 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 35.26315789473684) internal successors, (2010), 57 states have internal predecessors, (2010), 0 states have call successors, (0), 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:49:36,014 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:49:36,014 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] [2023-11-30 03:49:36,019 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:49:36,219 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,SelfDestructingSolverStorable12 [2023-11-30 03:49:36,219 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-30 03:49:36,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:49:36,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2093227799, now seen corresponding path program 4 times [2023-11-30 03:49:36,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:49:36,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510290149] [2023-11-30 03:49:36,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:49:36,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:49:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:49:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:49:36,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:49:36,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510290149] [2023-11-30 03:49:36,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510290149] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:49:36,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261638148] [2023-11-30 03:49:36,737 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-30 03:49:36,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:49:36,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:49:36,743 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:49:36,828 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:49:36,941 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-30 03:49:36,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:49:36,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-30 03:49:36,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:49:36,966 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:49:37,050 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:49:37,050 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:49:37,286 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-30 03:49:37,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-30 03:49:37,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:49:37,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-30 03:49:37,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-30 03:49:37,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:49:37,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-30 03:49:37,695 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 25 treesize of output 13 [2023-11-30 03:49:37,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:49:37,738 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 30 treesize of output 21 [2023-11-30 03:49:37,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-30 03:49:37,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:49:37,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-30 03:49:37,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:49:37,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-30 03:49:37,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:49:37,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-30 03:49:37,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:49:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:49:37,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:49:37,958 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_761 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-30 03:49:37,992 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false [2023-11-30 03:49:38,029 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-30 03:49:38,040 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_755) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_755) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_755) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_755) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) .cse0) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-30 03:49:38,051 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_755) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) .cse1 v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_755) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) .cse1 v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_755) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) .cse1 v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_755) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_760) .cse1 v_ArrVal_761) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false [2023-11-30 03:49:38,350 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 92 treesize of output 64 [2023-11-30 03:49:38,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:49:38,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:49:38,416 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 35 treesize of output 40 [2023-11-30 03:49:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:49:38,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261638148] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:49:38,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:49:38,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 45 [2023-11-30 03:49:38,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343098220] [2023-11-30 03:49:38,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:49:38,446 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-30 03:49:38,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:49:38,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-30 03:49:38,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1491, Unknown=9, NotChecked=410, Total=2070 [2023-11-30 03:49:38,448 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 122 [2023-11-30 03:49:38,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 10127 transitions, 178217 flow. Second operand has 46 states, 46 states have (on average 51.08695652173913) internal successors, (2350), 46 states have internal predecessors, (2350), 0 states have call successors, (0), 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:49:38,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:49:38,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 122 [2023-11-30 03:49:38,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:51:15,699 INFO L124 PetriNetUnfolderBase]: 46313/88463 cut-off events. [2023-11-30 03:51:15,700 INFO L125 PetriNetUnfolderBase]: For 252676/259675 co-relation queries the response was YES. [2023-11-30 03:51:15,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701096 conditions, 88463 events. 46313/88463 cut-off events. For 252676/259675 co-relation queries the response was YES. Maximal size of possible extension queue 2836. Compared 894748 event pairs, 1363 based on Foata normal form. 606/82685 useless extension candidates. Maximal degree in co-relation 623694. Up to 51414 conditions per place. [2023-11-30 03:51:16,507 INFO L140 encePairwiseOnDemand]: 76/122 looper letters, 8205 selfloop transitions, 1773 changer transitions 439/10550 dead transitions. [2023-11-30 03:51:16,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 10550 transitions, 206659 flow [2023-11-30 03:51:16,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-11-30 03:51:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2023-11-30 03:51:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 3450 transitions. [2023-11-30 03:51:16,522 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.504976580796253 [2023-11-30 03:51:16,522 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 3450 transitions. [2023-11-30 03:51:16,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 3450 transitions. [2023-11-30 03:51:16,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:51:16,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 3450 transitions. [2023-11-30 03:51:16,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 61.607142857142854) internal successors, (3450), 56 states have internal predecessors, (3450), 0 states have call successors, (0), 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:51:16,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 122.0) internal successors, (6954), 57 states have internal predecessors, (6954), 0 states have call successors, (0), 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:51:16,530 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 122.0) internal successors, (6954), 57 states have internal predecessors, (6954), 0 states have call successors, (0), 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:51:16,531 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 315 predicate places. [2023-11-30 03:51:16,531 INFO L500 AbstractCegarLoop]: Abstraction has has 437 places, 10550 transitions, 206659 flow [2023-11-30 03:51:16,532 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 51.08695652173913) internal successors, (2350), 46 states have internal predecessors, (2350), 0 states have call successors, (0), 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:51:16,532 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:51:16,532 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] [2023-11-30 03:51:16,541 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:51:16,736 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:51:16,737 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-30 03:51:16,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:51:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1720504945, now seen corresponding path program 5 times [2023-11-30 03:51:16,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:51:16,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113038977] [2023-11-30 03:51:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:51:16,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:51:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:51:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:51:17,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:51:17,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113038977] [2023-11-30 03:51:17,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113038977] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:51:17,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620938112] [2023-11-30 03:51:17,514 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-30 03:51:17,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:51:17,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:51:17,515 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:51:17,517 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:51:17,662 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 03:51:17,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:51:17,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-30 03:51:17,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:51:17,670 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:51:17,682 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-30 03:51:17,682 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:51:17,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:51:17,774 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:51:17,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-30 03:51:17,885 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-30 03:51:17,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-30 03:51:17,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:51:17,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-30 03:51:18,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-30 03:51:18,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51:18,087 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:51:18,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:51:18,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-30 03:51:18,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:51:18,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-30 03:51:18,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:51:18,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-30 03:51:18,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:51:18,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 43 treesize of output 32 [2023-11-30 03:51:18,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:51:18,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-30 03:51:18,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:51:18,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-30 03:51:18,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-30 03:51:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:51:18,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:51:18,298 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_866 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_866 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_866 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_866 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-30 03:51:18,319 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false [2023-11-30 03:51:18,355 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-30 03:51:18,365 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false [2023-11-30 03:51:18,375 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) .cse1 v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) .cse1 v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) .cse1 v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_866 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_865) .cse1 v_ArrVal_866) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false [2023-11-30 03:51:18,655 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 62 treesize of output 46 [2023-11-30 03:51:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:51:18,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620938112] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:51:18,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:51:18,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 41 [2023-11-30 03:51:18,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680311012] [2023-11-30 03:51:18,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:51:18,747 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-30 03:51:18,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:51:18,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-30 03:51:18,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1206, Unknown=7, NotChecked=370, Total=1722 [2023-11-30 03:51:18,749 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 122 [2023-11-30 03:51:18,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 10550 transitions, 206659 flow. Second operand has 42 states, 42 states have (on average 51.214285714285715) internal successors, (2151), 42 states have internal predecessors, (2151), 0 states have call successors, (0), 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:51:18,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:51:18,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 122 [2023-11-30 03:51:18,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:53:06,625 INFO L124 PetriNetUnfolderBase]: 46635/89156 cut-off events. [2023-11-30 03:53:06,625 INFO L125 PetriNetUnfolderBase]: For 305122/313617 co-relation queries the response was YES. [2023-11-30 03:53:06,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779356 conditions, 89156 events. 46635/89156 cut-off events. For 305122/313617 co-relation queries the response was YES. Maximal size of possible extension queue 2853. Compared 902986 event pairs, 1332 based on Foata normal form. 584/83403 useless extension candidates. Maximal degree in co-relation 668487. Up to 51827 conditions per place. [2023-11-30 03:53:07,590 INFO L140 encePairwiseOnDemand]: 76/122 looper letters, 8468 selfloop transitions, 1768 changer transitions 439/10808 dead transitions. [2023-11-30 03:53:07,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 10808 transitions, 233211 flow [2023-11-30 03:53:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-30 03:53:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-11-30 03:53:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 2980 transitions. [2023-11-30 03:53:07,593 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5088797814207651 [2023-11-30 03:53:07,593 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 2980 transitions. [2023-11-30 03:53:07,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 2980 transitions. [2023-11-30 03:53:07,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:53:07,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 2980 transitions. [2023-11-30 03:53:07,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 62.083333333333336) internal successors, (2980), 48 states have internal predecessors, (2980), 0 states have call successors, (0), 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:53:07,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 122.0) internal successors, (5978), 49 states have internal predecessors, (5978), 0 states have call successors, (0), 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:53:07,600 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 122.0) internal successors, (5978), 49 states have internal predecessors, (5978), 0 states have call successors, (0), 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:53:07,601 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 362 predicate places. [2023-11-30 03:53:07,601 INFO L500 AbstractCegarLoop]: Abstraction has has 484 places, 10808 transitions, 233211 flow [2023-11-30 03:53:07,601 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 51.214285714285715) internal successors, (2151), 42 states have internal predecessors, (2151), 0 states have call successors, (0), 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:53:07,601 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:53:07,601 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] [2023-11-30 03:53:07,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-30 03:53:07,805 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:53:07,806 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-30 03:53:07,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:53:07,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1413882917, now seen corresponding path program 1 times [2023-11-30 03:53:07,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:53:07,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457918253] [2023-11-30 03:53:07,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:53:07,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:53:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:53:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:53:08,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:53:08,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457918253] [2023-11-30 03:53:08,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457918253] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:53:08,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255735429] [2023-11-30 03:53:08,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:53:08,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:53:08,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:53:08,512 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:53:08,514 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:53:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:53:08,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-30 03:53:08,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:53:08,631 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:53:08,658 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-30 03:53:08,658 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:53:08,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:53:08,734 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:53:08,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-30 03:53:08,841 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-30 03:53:08,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-30 03:53:08,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:53:08,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-30 03:53:08,967 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:53:08,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-30 03:53:08,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-30 03:53:08,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:53:08,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-30 03:53:08,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:53:08,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-30 03:53:09,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-30 03:53:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:53:09,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:53:09,110 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_963 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)) (forall ((v_ArrVal_963 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)) (forall ((v_ArrVal_963 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_963 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2) 0)))))) is different from false [2023-11-30 03:53:09,119 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) (.cse3 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_963 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_963 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)) (forall ((v_ArrVal_963 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2) 0)) (forall ((v_ArrVal_963 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3) 0)))))) is different from false [2023-11-30 03:53:09,239 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_958 (Array Int Int))) (not (= c_threadThread1of2ForFork0_~arg.base (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_958) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false [2023-11-30 03:53:09,352 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_957) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false [2023-11-30 03:53:09,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 57 [2023-11-30 03:53:09,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 52 treesize of output 50 [2023-11-30 03:53:09,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:53:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:53:09,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255735429] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:53:09,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:53:09,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 42 [2023-11-30 03:53:09,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245106155] [2023-11-30 03:53:09,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:53:09,575 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-30 03:53:09,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:53:09,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-30 03:53:09,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1312, Unknown=51, NotChecked=308, Total=1806 [2023-11-30 03:53:09,576 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 122 [2023-11-30 03:53:09,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 10808 transitions, 233211 flow. Second operand has 43 states, 43 states have (on average 47.16279069767442) internal successors, (2028), 43 states have internal predecessors, (2028), 0 states have call successors, (0), 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:53:09,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:53:09,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 122 [2023-11-30 03:53:09,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:55:22,412 INFO L124 PetriNetUnfolderBase]: 49652/94623 cut-off events. [2023-11-30 03:55:22,412 INFO L125 PetriNetUnfolderBase]: For 361956/375073 co-relation queries the response was YES. [2023-11-30 03:55:22,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906103 conditions, 94623 events. 49652/94623 cut-off events. For 361956/375073 co-relation queries the response was YES. Maximal size of possible extension queue 2869. Compared 955557 event pairs, 1347 based on Foata normal form. 504/88791 useless extension candidates. Maximal degree in co-relation 791201. Up to 55234 conditions per place. [2023-11-30 03:55:23,638 INFO L140 encePairwiseOnDemand]: 85/122 looper letters, 9622 selfloop transitions, 2737 changer transitions 546/13098 dead transitions. [2023-11-30 03:55:23,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 13098 transitions, 306208 flow [2023-11-30 03:55:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-11-30 03:55:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-11-30 03:55:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 3028 transitions. [2023-11-30 03:55:23,646 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.47730138713745274 [2023-11-30 03:55:23,646 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 3028 transitions. [2023-11-30 03:55:23,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 3028 transitions. [2023-11-30 03:55:23,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:55:23,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 3028 transitions. [2023-11-30 03:55:23,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 58.23076923076923) internal successors, (3028), 52 states have internal predecessors, (3028), 0 states have call successors, (0), 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:55:23,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 122.0) internal successors, (6466), 53 states have internal predecessors, (6466), 0 states have call successors, (0), 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:55:23,654 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 122.0) internal successors, (6466), 53 states have internal predecessors, (6466), 0 states have call successors, (0), 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:55:23,654 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 413 predicate places. [2023-11-30 03:55:23,654 INFO L500 AbstractCegarLoop]: Abstraction has has 535 places, 13098 transitions, 306208 flow [2023-11-30 03:55:23,655 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 47.16279069767442) internal successors, (2028), 43 states have internal predecessors, (2028), 0 states have call successors, (0), 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:55:23,655 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:55:23,655 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] [2023-11-30 03:55:23,667 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:55:23,859 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,SelfDestructingSolverStorable15 [2023-11-30 03:55:23,859 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-30 03:55:23,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:55:23,859 INFO L85 PathProgramCache]: Analyzing trace with hash -125003685, now seen corresponding path program 6 times [2023-11-30 03:55:23,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:55:23,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189864078] [2023-11-30 03:55:23,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:55:23,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:55:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:55:24,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:55:24,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:55:24,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189864078] [2023-11-30 03:55:24,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189864078] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:55:24,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870606452] [2023-11-30 03:55:24,216 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-30 03:55:24,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:55:24,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:55:24,218 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:55:24,218 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:55:24,344 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-30 03:55:24,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:55:24,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-30 03:55:24,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:55:24,365 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:55:24,417 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:55:24,417 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:55:24,527 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-30 03:55:24,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-30 03:55:24,626 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 25 treesize of output 13 [2023-11-30 03:55:24,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-30 03:55:24,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:55:24,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-30 03:55:24,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-30 03:55:24,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:55:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:55:24,826 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:55:24,838 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1062 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1062 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1062 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1062 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-30 03:55:24,847 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1062 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1062 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1062 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1062 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-30 03:55:24,856 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1062 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1062 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1062 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1062 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-30 03:55:24,866 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1062 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1062 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1062 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1062 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1062) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false [2023-11-30 03:55:24,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:55:24,878 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 35 treesize of output 51 [2023-11-30 03:55:24,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:55:24,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 32 [2023-11-30 03:55:24,888 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:55:24,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1 [2023-11-30 03:55:24,893 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:55:24,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2023-11-30 03:55:24,898 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-30 03:55:24,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2023-11-30 03:55:24,964 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~t~1#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1053) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false [2023-11-30 03:55:25,028 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 45 treesize of output 29 [2023-11-30 03:55:25,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-11-30 03:55:25,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:55:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:55:25,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870606452] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:55:25,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:55:25,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 42 [2023-11-30 03:55:25,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277859801] [2023-11-30 03:55:25,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:55:25,083 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-30 03:55:25,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:55:25,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-30 03:55:25,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1269, Unknown=11, NotChecked=380, Total=1806 [2023-11-30 03:55:25,084 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 122 [2023-11-30 03:55:25,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 13098 transitions, 306208 flow. Second operand has 43 states, 43 states have (on average 51.093023255813954) internal successors, (2197), 43 states have internal predecessors, (2197), 0 states have call successors, (0), 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:55:25,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:55:25,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 122 [2023-11-30 03:55:25,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:59:46,526 INFO L124 PetriNetUnfolderBase]: 78269/147481 cut-off events. [2023-11-30 03:59:46,526 INFO L125 PetriNetUnfolderBase]: For 623967/647525 co-relation queries the response was YES. [2023-11-30 03:59:46,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1566594 conditions, 147481 events. 78269/147481 cut-off events. For 623967/647525 co-relation queries the response was YES. Maximal size of possible extension queue 4746. Compared 1577520 event pairs, 1872 based on Foata normal form. 1077/138120 useless extension candidates. Maximal degree in co-relation 1405157. Up to 89915 conditions per place. [2023-11-30 03:59:48,205 INFO L140 encePairwiseOnDemand]: 74/122 looper letters, 17489 selfloop transitions, 3613 changer transitions 1030/22293 dead transitions. [2023-11-30 03:59:48,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 22293 transitions, 569736 flow [2023-11-30 03:59:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-30 03:59:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-11-30 03:59:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 2753 transitions. [2023-11-30 03:59:48,207 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5503798480607757 [2023-11-30 03:59:48,207 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 2753 transitions. [2023-11-30 03:59:48,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 2753 transitions. [2023-11-30 03:59:48,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:59:48,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 2753 transitions. [2023-11-30 03:59:48,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 67.14634146341463) internal successors, (2753), 41 states have internal predecessors, (2753), 0 states have call successors, (0), 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:59:48,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 122.0) internal successors, (5124), 42 states have internal predecessors, (5124), 0 states have call successors, (0), 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:59:48,229 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 122.0) internal successors, (5124), 42 states have internal predecessors, (5124), 0 states have call successors, (0), 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:59:48,229 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 453 predicate places. [2023-11-30 03:59:48,229 INFO L500 AbstractCegarLoop]: Abstraction has has 575 places, 22293 transitions, 569736 flow [2023-11-30 03:59:48,229 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 51.093023255813954) internal successors, (2197), 43 states have internal predecessors, (2197), 0 states have call successors, (0), 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:59:48,229 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:59:48,230 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] [2023-11-30 03:59:48,239 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:59:48,430 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,SelfDestructingSolverStorable16 [2023-11-30 03:59:48,430 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-30 03:59:48,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:59:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash 249114519, now seen corresponding path program 2 times [2023-11-30 03:59:48,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:59:48,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389460616] [2023-11-30 03:59:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:59:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:59:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:59:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:59:48,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:59:48,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389460616] [2023-11-30 03:59:48,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389460616] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:59:48,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209304473] [2023-11-30 03:59:48,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 03:59:48,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:59:48,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:59:48,974 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:59:48,976 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:59:49,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 03:59:49,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:59:49,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-30 03:59:49,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:59:49,132 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:59:49,196 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:59:49,196 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:59:49,343 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-30 03:59:49,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-30 03:59:49,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:59:49,348 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:59:49,483 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 25 treesize of output 13 [2023-11-30 03:59:49,490 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:59:49,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-30 03:59:49,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:59:49,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-30 03:59:49,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-30 03:59:49,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:59:49,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:59:49,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:59:49,857 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)))) is different from false [2023-11-30 03:59:49,884 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse0)) 0)))) is different from false [2023-11-30 03:59:49,893 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)))))) is different from false [2023-11-30 03:59:49,902 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse3)) (.cse1 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse3)) 0)))))) is different from false [2023-11-30 03:59:49,936 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse2)) (.cse4 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse2)) (.cse1 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3 0) .cse4 0) .cse1 0)))) (and (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3) 0)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_1158) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse4) 0)))))) is different from false [2023-11-30 03:59:50,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:59:50,010 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 50 treesize of output 66 [2023-11-30 03:59:50,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:59:50,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38 [2023-11-30 03:59:50,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2023-11-30 03:59:50,024 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-30 03:59:50,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-30 03:59:50,028 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-30 03:59:50,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-30 03:59:50,045 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-30 03:59:50,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-30 03:59:50,236 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1152) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false [2023-11-30 03:59:50,246 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1152) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false [2023-11-30 03:59:50,267 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1152) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc8#1.base|))) is different from false [2023-11-30 03:59:50,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-30 03:59:50,300 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 45 treesize of output 29 [2023-11-30 03:59:50,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 8 treesize of output 6 [2023-11-30 03:59:50,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:59:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:59:50,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209304473] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:59:50,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:59:50,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 44 [2023-11-30 03:59:50,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892912571] [2023-11-30 03:59:50,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:59:50,353 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-30 03:59:50,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:59:50,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-30 03:59:50,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1206, Unknown=8, NotChecked=616, Total=1980 [2023-11-30 03:59:50,355 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 122 [2023-11-30 03:59:50,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 22293 transitions, 569736 flow. Second operand has 45 states, 45 states have (on average 47.08888888888889) internal successors, (2119), 45 states have internal predecessors, (2119), 0 states have call successors, (0), 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:59:50,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:59:50,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 122 [2023-11-30 03:59:50,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-30 04:00:18,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-11-30 04:00:18,793 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2023-11-30 04:00:18,798 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 04:00:18,831 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 04:00:18,832 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 04:00:18,998 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,SelfDestructingSolverStorable17 [2023-11-30 04:00:18,998 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (45states, 45/122 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 69803 conditions, 5825 events (2417/5824 cut-off events. For 21346/21510 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 56056 event pairs, 34 based on Foata normal form. 24/6287 useless extension candidates. Maximal degree in co-relation 68949. Up to 3796 conditions per place.). [2023-11-30 04:00:18,998 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2023-11-30 04:00:18,998 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2023-11-30 04:00:18,999 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2023-11-30 04:00:18,999 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2023-11-30 04:00:18,999 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2023-11-30 04:00:18,999 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2023-11-30 04:00:18,999 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2023-11-30 04:00:18,999 INFO L457 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1] [2023-11-30 04:00:19,001 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-11-30 04:00:19,001 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:00:19,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:00:19 BasicIcfg [2023-11-30 04:00:19,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:00:19,004 INFO L158 Benchmark]: Toolchain (without parser) took 834682.33ms. Allocated memory was 358.6MB in the beginning and 9.3GB in the end (delta: 8.9GB). Free memory was 317.3MB in the beginning and 5.2GB in the end (delta: -4.9GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2023-11-30 04:00:19,004 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 358.6MB. Free memory was 315.0MB in the beginning and 314.8MB in the end (delta: 204.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:00:19,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.94ms. Allocated memory is still 358.6MB. Free memory was 317.3MB in the beginning and 289.3MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-11-30 04:00:19,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.04ms. Allocated memory is still 358.6MB. Free memory was 289.3MB in the beginning and 286.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:00:19,005 INFO L158 Benchmark]: Boogie Preprocessor took 30.86ms. Allocated memory is still 358.6MB. Free memory was 286.9MB in the beginning and 284.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:00:19,005 INFO L158 Benchmark]: RCFGBuilder took 340.89ms. Allocated memory is still 358.6MB. Free memory was 284.8MB in the beginning and 267.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-11-30 04:00:19,005 INFO L158 Benchmark]: TraceAbstraction took 833795.94ms. Allocated memory was 358.6MB in the beginning and 9.3GB in the end (delta: 8.9GB). Free memory was 267.0MB in the beginning and 5.2GB in the end (delta: -4.9GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2023-11-30 04:00:19,006 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 358.6MB. Free memory was 315.0MB in the beginning and 314.8MB in the end (delta: 204.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 451.94ms. Allocated memory is still 358.6MB. Free memory was 317.3MB in the beginning and 289.3MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.04ms. Allocated memory is still 358.6MB. Free memory was 289.3MB in the beginning and 286.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.86ms. Allocated memory is still 358.6MB. Free memory was 286.9MB in the beginning and 284.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 340.89ms. Allocated memory is still 358.6MB. Free memory was 284.8MB in the beginning and 267.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 833795.94ms. Allocated memory was 358.6MB in the beginning and 9.3GB in the end (delta: 8.9GB). Free memory was 267.0MB in the beginning and 5.2GB in the end (delta: -4.9GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (45states, 45/122 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 69803 conditions, 5825 events (2417/5824 cut-off events. For 21346/21510 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 56056 event pairs, 34 based on Foata normal form. 24/6287 useless extension candidates. Maximal degree in co-relation 68949. Up to 3796 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 (45states, 45/122 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 69803 conditions, 5825 events (2417/5824 cut-off events. For 21346/21510 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 56056 event pairs, 34 based on Foata normal form. 24/6287 useless extension candidates. Maximal degree in co-relation 68949. Up to 3796 conditions per place.). - TimeoutResultAtElement [Line: 1039]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (45states, 45/122 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 69803 conditions, 5825 events (2417/5824 cut-off events. For 21346/21510 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 56056 event pairs, 34 based on Foata normal form. 24/6287 useless extension candidates. Maximal degree in co-relation 68949. Up to 3796 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 (45states, 45/122 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 69803 conditions, 5825 events (2417/5824 cut-off events. For 21346/21510 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 56056 event pairs, 34 based on Foata normal form. 24/6287 useless extension candidates. Maximal degree in co-relation 68949. Up to 3796 conditions per place.). - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (45states, 45/122 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 69803 conditions, 5825 events (2417/5824 cut-off events. For 21346/21510 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 56056 event pairs, 34 based on Foata normal form. 24/6287 useless extension candidates. Maximal degree in co-relation 68949. Up to 3796 conditions per place.). - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (45states, 45/122 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 69803 conditions, 5825 events (2417/5824 cut-off events. For 21346/21510 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 56056 event pairs, 34 based on Foata normal form. 24/6287 useless extension candidates. Maximal degree in co-relation 68949. Up to 3796 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 118 locations, 7 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: 2.1s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 478 IncrementalHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 66 mSDtfsCounter, 478 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1620occurred in iteration=3, InterpolantAutomatonStates: 18, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 136 locations, 8 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: 831.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 811.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11344 SdHoareTripleChecker+Valid, 21.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11344 mSDsluCounter, 9389 SdHoareTripleChecker+Invalid, 18.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 29666 IncrementalHoareTripleChecker+Unchecked, 8593 mSDsCounter, 1665 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43597 IncrementalHoareTripleChecker+Invalid, 74928 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1665 mSolverCounterUnsat, 796 mSDtfsCounter, 43597 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2005 GetRequests, 1004 SyntacticMatches, 140 SemanticMatches, 861 ConstructedPredicates, 48 IntricatePredicates, 0 DeprecatedPredicates, 21793 ImplicationChecksByTransitivity, 24.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=569736occurred in iteration=13, InterpolantAutomatonStates: 466, 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.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 1374 NumberOfCodeBlocks, 1374 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1948 ConstructedInterpolants, 216 QuantifiedInterpolants, 31628 SizeOfPredicates, 146 NumberOfNonLiveVariables, 2028 ConjunctsInSsa, 453 ConjunctsInUnsatCore, 34 InterpolantComputations, 4 PerfectInterpolantSequences, 1/31 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