/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.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.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/pthread/sync01.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:04:02,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:04:02,879 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 [2025-03-15 00:04:02,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:04:02,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:04:02,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:04:02,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:04:02,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:04:02,911 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:04:02,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:04:02,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:04:02,912 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:04:02,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:04:02,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:04:02,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:04:02,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:04:02,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:04:02,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:04:02,913 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:04:02,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:04:02,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:04:02,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:04:02,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:04:02,913 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:04:02,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:04:02,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:04:02,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:04:02,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:04:02,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:04:02,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:04:02,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:04:02,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:04:02,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All 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 [2025-03-15 00:04:03,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:04:03,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:04:03,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:04:03,182 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:04:03,182 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:04:03,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/sync01.i [2025-03-15 00:04:04,357 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c817e017f/874b745f52e34b5794a74a975202fe63/FLAG7123b707a [2025-03-15 00:04:04,650 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:04:04,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/sync01.i [2025-03-15 00:04:04,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c817e017f/874b745f52e34b5794a74a975202fe63/FLAG7123b707a [2025-03-15 00:04:04,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c817e017f/874b745f52e34b5794a74a975202fe63 [2025-03-15 00:04:04,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:04:04,965 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:04:04,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:04:04,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:04:04,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:04:04,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:04:04" (1/1) ... [2025-03-15 00:04:04,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13018681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:04, skipping insertion in model container [2025-03-15 00:04:04,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:04:04" (1/1) ... [2025-03-15 00:04:05,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:04:05,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:04:05,254 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:04:05,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:04:05,367 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:04:05,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:05 WrapperNode [2025-03-15 00:04:05,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:04:05,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:04:05,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:04:05,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:04:05,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:05" (1/1) ... [2025-03-15 00:04:05,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:05" (1/1) ... [2025-03-15 00:04:05,424 INFO L138 Inliner]: procedures = 268, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 260 [2025-03-15 00:04:05,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:04:05,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:04:05,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:04:05,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:04:05,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:05" (1/1) ... [2025-03-15 00:04:05,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:05" (1/1) ... [2025-03-15 00:04:05,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:05" (1/1) ... [2025-03-15 00:04:05,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:05" (1/1) ... [2025-03-15 00:04:05,456 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:05" (1/1) ... [2025-03-15 00:04:05,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:05" (1/1) ... [2025-03-15 00:04:05,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:05" (1/1) ... [2025-03-15 00:04:05,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:05" (1/1) ... [2025-03-15 00:04:05,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:05" (1/1) ... [2025-03-15 00:04:05,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:04:05,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:04:05,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:04:05,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:04:05,473 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:05" (1/1) ... [2025-03-15 00:04:05,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:04:05,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:04:05,502 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) [2025-03-15 00:04:05,505 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 [2025-03-15 00:04:05,521 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:04:05,521 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:04:05,521 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:04:05,521 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:04:05,521 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:04:05,521 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:04:05,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:04:05,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:04:05,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:04:05,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:04:05,522 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 00:04:05,636 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:04:05,638 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:04:05,972 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:04:05,972 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:04:05,998 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:04:05,999 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 00:04:05,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:04:05 BoogieIcfgContainer [2025-03-15 00:04:05,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:04:06,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:04:06,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:04:06,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:04:06,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:04:04" (1/3) ... [2025-03-15 00:04:06,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72185d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:04:06, skipping insertion in model container [2025-03-15 00:04:06,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:05" (2/3) ... [2025-03-15 00:04:06,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72185d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:04:06, skipping insertion in model container [2025-03-15 00:04:06,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:04:05" (3/3) ... [2025-03-15 00:04:06,006 INFO L128 eAbstractionObserver]: Analyzing ICFG sync01.i [2025-03-15 00:04:06,017 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:04:06,019 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG sync01.i that has 3 procedures, 317 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-15 00:04:06,019 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:04:06,080 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 00:04:06,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:04:06,125 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@5382f4f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:04:06,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-15 00:04:06,196 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:04:06,200 INFO L124 PetriNetUnfolderBase]: 0/235 cut-off events. [2025-03-15 00:04:06,201 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:04:06,202 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:06,202 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:04:06,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:04:06,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:06,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2124819626, now seen corresponding path program 1 times [2025-03-15 00:04:06,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:06,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697492968] [2025-03-15 00:04:06,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:06,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:06,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697492968] [2025-03-15 00:04:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697492968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:06,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:06,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:04:06,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156199778] [2025-03-15 00:04:06,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:06,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:06,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:06,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:06,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:06,632 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 322 [2025-03-15 00:04:06,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 322 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:06,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:06,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 322 [2025-03-15 00:04:06,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:06,917 INFO L124 PetriNetUnfolderBase]: 219/905 cut-off events. [2025-03-15 00:04:06,918 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-15 00:04:06,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 905 events. 219/905 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3768 event pairs, 189 based on Foata normal form. 2/790 useless extension candidates. Maximal degree in co-relation 1050. Up to 447 conditions per place. [2025-03-15 00:04:06,931 INFO L140 encePairwiseOnDemand]: 315/322 looper letters, 35 selfloop transitions, 2 changer transitions 9/313 dead transitions. [2025-03-15 00:04:06,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 313 transitions, 716 flow [2025-03-15 00:04:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions. [2025-03-15 00:04:06,949 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9057971014492754 [2025-03-15 00:04:06,954 INFO L298 CegarLoopForPetriNet]: 323 programPoint places, -3 predicate places. [2025-03-15 00:04:06,954 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 313 transitions, 716 flow [2025-03-15 00:04:06,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:06,955 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:06,955 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:04:06,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:04:06,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:04:06,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:06,957 INFO L85 PathProgramCache]: Analyzing trace with hash -663787489, now seen corresponding path program 1 times [2025-03-15 00:04:06,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:06,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452358320] [2025-03-15 00:04:06,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:06,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:07,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:07,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452358320] [2025-03-15 00:04:07,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452358320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:07,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:07,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:04:07,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288304536] [2025-03-15 00:04:07,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:07,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:07,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:07,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:07,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:07,211 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 322 [2025-03-15 00:04:07,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 313 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:07,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:07,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 322 [2025-03-15 00:04:07,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:07,494 INFO L124 PetriNetUnfolderBase]: 232/947 cut-off events. [2025-03-15 00:04:07,495 INFO L125 PetriNetUnfolderBase]: For 232/280 co-relation queries the response was YES. [2025-03-15 00:04:07,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1955 conditions, 947 events. 232/947 cut-off events. For 232/280 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4208 event pairs, 80 based on Foata normal form. 0/852 useless extension candidates. Maximal degree in co-relation 1566. Up to 479 conditions per place. [2025-03-15 00:04:07,505 INFO L140 encePairwiseOnDemand]: 306/322 looper letters, 45 selfloop transitions, 10 changer transitions 11/336 dead transitions. [2025-03-15 00:04:07,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 336 transitions, 930 flow [2025-03-15 00:04:07,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2025-03-15 00:04:07,508 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.937888198757764 [2025-03-15 00:04:07,509 INFO L298 CegarLoopForPetriNet]: 323 programPoint places, -2 predicate places. [2025-03-15 00:04:07,509 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 336 transitions, 930 flow [2025-03-15 00:04:07,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:07,509 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:07,510 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:04:07,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:04:07,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:04:07,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:07,511 INFO L85 PathProgramCache]: Analyzing trace with hash 6922112, now seen corresponding path program 1 times [2025-03-15 00:04:07,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:07,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285457503] [2025-03-15 00:04:07,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:07,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:07,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285457503] [2025-03-15 00:04:07,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285457503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:07,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:07,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:04:07,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952839097] [2025-03-15 00:04:07,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:07,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:07,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:07,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:07,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:07,767 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 322 [2025-03-15 00:04:07,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 336 transitions, 930 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:07,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:07,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 322 [2025-03-15 00:04:07,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:07,881 INFO L124 PetriNetUnfolderBase]: 139/677 cut-off events. [2025-03-15 00:04:07,882 INFO L125 PetriNetUnfolderBase]: For 291/335 co-relation queries the response was YES. [2025-03-15 00:04:07,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 677 events. 139/677 cut-off events. For 291/335 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2078 event pairs, 52 based on Foata normal form. 0/621 useless extension candidates. Maximal degree in co-relation 1101. Up to 280 conditions per place. [2025-03-15 00:04:07,886 INFO L140 encePairwiseOnDemand]: 317/322 looper letters, 27 selfloop transitions, 2 changer transitions 11/327 dead transitions. [2025-03-15 00:04:07,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 327 transitions, 937 flow [2025-03-15 00:04:07,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:07,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2025-03-15 00:04:07,889 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.937888198757764 [2025-03-15 00:04:07,889 INFO L298 CegarLoopForPetriNet]: 323 programPoint places, -4 predicate places. [2025-03-15 00:04:07,889 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 327 transitions, 937 flow [2025-03-15 00:04:07,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:07,890 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:07,890 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:04:07,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:04:07,890 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:04:07,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:07,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1632736794, now seen corresponding path program 1 times [2025-03-15 00:04:07,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:07,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47983324] [2025-03-15 00:04:07,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:07,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:08,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:08,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47983324] [2025-03-15 00:04:08,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47983324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:08,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:08,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:04:08,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311497341] [2025-03-15 00:04:08,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:08,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:08,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:08,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:08,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:08,073 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 322 [2025-03-15 00:04:08,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 327 transitions, 937 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:08,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:08,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 322 [2025-03-15 00:04:08,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:08,234 INFO L124 PetriNetUnfolderBase]: 183/780 cut-off events. [2025-03-15 00:04:08,234 INFO L125 PetriNetUnfolderBase]: For 604/672 co-relation queries the response was YES. [2025-03-15 00:04:08,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2009 conditions, 780 events. 183/780 cut-off events. For 604/672 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2622 event pairs, 46 based on Foata normal form. 2/735 useless extension candidates. Maximal degree in co-relation 1636. Up to 322 conditions per place. [2025-03-15 00:04:08,239 INFO L140 encePairwiseOnDemand]: 315/322 looper letters, 58 selfloop transitions, 11 changer transitions 14/351 dead transitions. [2025-03-15 00:04:08,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 351 transitions, 1244 flow [2025-03-15 00:04:08,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2025-03-15 00:04:08,241 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.917184265010352 [2025-03-15 00:04:08,242 INFO L298 CegarLoopForPetriNet]: 323 programPoint places, -2 predicate places. [2025-03-15 00:04:08,242 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 351 transitions, 1244 flow [2025-03-15 00:04:08,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:08,242 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:08,243 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:04:08,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:04:08,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:04:08,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1880335143, now seen corresponding path program 1 times [2025-03-15 00:04:08,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:08,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592042451] [2025-03-15 00:04:08,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:08,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:08,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:08,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592042451] [2025-03-15 00:04:08,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592042451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:08,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:08,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:04:08,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809178751] [2025-03-15 00:04:08,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:08,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:08,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:08,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:08,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:08,544 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2025-03-15 00:04:08,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 351 transitions, 1244 flow. Second operand has 3 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:08,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:08,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2025-03-15 00:04:08,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:08,614 INFO L124 PetriNetUnfolderBase]: 10/346 cut-off events. [2025-03-15 00:04:08,614 INFO L125 PetriNetUnfolderBase]: For 360/384 co-relation queries the response was YES. [2025-03-15 00:04:08,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 346 events. 10/346 cut-off events. For 360/384 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 183 event pairs, 0 based on Foata normal form. 30/373 useless extension candidates. Maximal degree in co-relation 310. Up to 58 conditions per place. [2025-03-15 00:04:08,615 INFO L140 encePairwiseOnDemand]: 316/322 looper letters, 12 selfloop transitions, 10 changer transitions 19/315 dead transitions. [2025-03-15 00:04:08,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 315 transitions, 995 flow [2025-03-15 00:04:08,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 915 transitions. [2025-03-15 00:04:08,618 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9472049689440993 [2025-03-15 00:04:08,620 INFO L298 CegarLoopForPetriNet]: 323 programPoint places, -3 predicate places. [2025-03-15 00:04:08,620 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 315 transitions, 995 flow [2025-03-15 00:04:08,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:08,620 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:08,621 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:04:08,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:04:08,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:04:08,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:08,622 INFO L85 PathProgramCache]: Analyzing trace with hash 565297476, now seen corresponding path program 1 times [2025-03-15 00:04:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684526047] [2025-03-15 00:04:08,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:08,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:08,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:08,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684526047] [2025-03-15 00:04:08,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684526047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:08,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:08,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:04:08,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490410248] [2025-03-15 00:04:08,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:08,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:08,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:08,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:08,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:08,746 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 322 [2025-03-15 00:04:08,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 315 transitions, 995 flow. Second operand has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:08,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:08,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 322 [2025-03-15 00:04:08,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:08,810 INFO L124 PetriNetUnfolderBase]: 10/347 cut-off events. [2025-03-15 00:04:08,810 INFO L125 PetriNetUnfolderBase]: For 304/340 co-relation queries the response was YES. [2025-03-15 00:04:08,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 347 events. 10/347 cut-off events. For 304/340 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 192 event pairs, 0 based on Foata normal form. 1/346 useless extension candidates. Maximal degree in co-relation 357. Up to 57 conditions per place. [2025-03-15 00:04:08,811 INFO L140 encePairwiseOnDemand]: 319/322 looper letters, 0 selfloop transitions, 0 changer transitions 314/314 dead transitions. [2025-03-15 00:04:08,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 314 transitions, 1063 flow [2025-03-15 00:04:08,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2025-03-15 00:04:08,813 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8964803312629399 [2025-03-15 00:04:08,813 INFO L298 CegarLoopForPetriNet]: 323 programPoint places, -2 predicate places. [2025-03-15 00:04:08,813 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 314 transitions, 1063 flow [2025-03-15 00:04:08,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:08,828 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/sync01.i_petrified1_AllErrorsAtOnce [2025-03-15 00:04:08,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2025-03-15 00:04:08,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-15 00:04:08,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-15 00:04:08,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-15 00:04:08,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-15 00:04:08,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-15 00:04:08,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-15 00:04:08,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-15 00:04:08,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 16 remaining) [2025-03-15 00:04:08,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 16 remaining) [2025-03-15 00:04:08,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-15 00:04:08,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-15 00:04:08,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-15 00:04:08,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-15 00:04:08,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-15 00:04:08,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-15 00:04:08,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:04:08,858 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-15 00:04:08,865 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:04:08,865 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:04:08,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:04:08 BasicIcfg [2025-03-15 00:04:08,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:04:08,875 INFO L158 Benchmark]: Toolchain (without parser) took 3909.49ms. Allocated memory was 71.3MB in the beginning and 209.7MB in the end (delta: 138.4MB). Free memory was 42.9MB in the beginning and 130.4MB in the end (delta: -87.5MB). Peak memory consumption was 49.7MB. Max. memory is 8.0GB. [2025-03-15 00:04:08,875 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 71.3MB. Free memory is still 35.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:04:08,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.00ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 37.8MB in the end (delta: 5.1MB). Peak memory consumption was 30.2MB. Max. memory is 8.0GB. [2025-03-15 00:04:08,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.70ms. Allocated memory is still 71.3MB. Free memory was 37.8MB in the beginning and 34.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:04:08,877 INFO L158 Benchmark]: Boogie Preprocessor took 42.40ms. Allocated memory is still 71.3MB. Free memory was 34.7MB in the beginning and 32.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:04:08,877 INFO L158 Benchmark]: RCFGBuilder took 530.32ms. Allocated memory is still 71.3MB. Free memory was 32.6MB in the beginning and 31.6MB in the end (delta: 985.2kB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. [2025-03-15 00:04:08,877 INFO L158 Benchmark]: TraceAbstraction took 2872.59ms. Allocated memory was 71.3MB in the beginning and 209.7MB in the end (delta: 138.4MB). Free memory was 30.6MB in the beginning and 130.4MB in the end (delta: -99.9MB). Peak memory consumption was 38.2MB. Max. memory is 8.0GB. [2025-03-15 00:04:08,878 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.23ms. Allocated memory is still 71.3MB. Free memory is still 35.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 404.00ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 37.8MB in the end (delta: 5.1MB). Peak memory consumption was 30.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.70ms. Allocated memory is still 71.3MB. Free memory was 37.8MB in the beginning and 34.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 42.40ms. Allocated memory is still 71.3MB. Free memory was 34.7MB in the beginning and 32.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 530.32ms. Allocated memory is still 71.3MB. Free memory was 32.6MB in the beginning and 31.6MB in the end (delta: 985.2kB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2872.59ms. Allocated memory was 71.3MB in the beginning and 209.7MB in the end (delta: 138.4MB). Free memory was 30.6MB in the beginning and 130.4MB in the end (delta: -99.9MB). Peak memory consumption was 38.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 936]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 938]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 938]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 946]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 948]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 948]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 956]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 964]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 369 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 245 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 99 mSDtfsCounter, 245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1244occurred in iteration=4, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1541 NumberOfCodeBlocks, 1541 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1535 ConstructedInterpolants, 0 QuantifiedInterpolants, 1579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:04:08,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...