./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 860528881155a718438c0581485d42cc235131c30c9ba38f0a976304f206e75d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:18:20,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:18:20,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:18:20,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:18:20,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:18:20,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:18:20,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:18:20,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:18:20,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:18:20,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:18:20,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:18:20,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:18:20,371 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:18:20,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:18:20,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:18:20,371 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:18:20,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:18:20,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:18:20,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:18:20,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:18:20,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:18:20,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:18:20,372 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:18:20,372 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:18:20,372 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:18:20,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:18:20,372 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:18:20,372 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:18:20,372 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:18:20,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:18:20,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:18:20,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:18:20,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:18:20,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:18:20,373 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:18:20,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:18:20,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:18:20,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:18:20,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:18:20,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:18:20,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:18:20,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:18:20,374 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 860528881155a718438c0581485d42cc235131c30c9ba38f0a976304f206e75d [2025-03-17 11:18:20,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:18:20,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:18:20,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:18:20,611 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:18:20,611 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:18:20,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.i [2025-03-17 11:18:21,747 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4dbb56fb/5981b966115d4843b027ea7292e06b56/FLAG4f1695f52 [2025-03-17 11:18:22,042 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:18:22,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.i [2025-03-17 11:18:22,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4dbb56fb/5981b966115d4843b027ea7292e06b56/FLAG4f1695f52 [2025-03-17 11:18:22,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4dbb56fb/5981b966115d4843b027ea7292e06b56 [2025-03-17 11:18:22,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:18:22,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:18:22,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:18:22,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:18:22,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:18:22,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:18:22" (1/1) ... [2025-03-17 11:18:22,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f6bd41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:22, skipping insertion in model container [2025-03-17 11:18:22,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:18:22" (1/1) ... [2025-03-17 11:18:22,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:18:22,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:18:22,358 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:18:22,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:18:22,432 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:18:22,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:22 WrapperNode [2025-03-17 11:18:22,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:18:22,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:18:22,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:18:22,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:18:22,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:22" (1/1) ... [2025-03-17 11:18:22,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:22" (1/1) ... [2025-03-17 11:18:22,471 INFO L138 Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2025-03-17 11:18:22,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:18:22,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:18:22,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:18:22,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:18:22,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:22" (1/1) ... [2025-03-17 11:18:22,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:22" (1/1) ... [2025-03-17 11:18:22,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:22" (1/1) ... [2025-03-17 11:18:22,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:22" (1/1) ... [2025-03-17 11:18:22,490 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:22" (1/1) ... [2025-03-17 11:18:22,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:22" (1/1) ... [2025-03-17 11:18:22,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:22" (1/1) ... [2025-03-17 11:18:22,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:22" (1/1) ... [2025-03-17 11:18:22,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:18:22,494 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:18:22,494 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:18:22,494 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:18:22,499 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:22" (1/1) ... [2025-03-17 11:18:22,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:18:22,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:18:22,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:18:22,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:18:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:18:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:18:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:18:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:18:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:18:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:18:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:18:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-17 11:18:22,555 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-17 11:18:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:18:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:18:22,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:18:22,557 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:18:22,656 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:18:22,657 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:18:22,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~#tids~0#1.base, main_~#tids~0#1.offset; [2025-03-17 11:18:22,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-1: SUMMARY for call ULTIMATE.dealloc(main_~#tids~0#1.base, main_~#tids~0#1.offset); srcloc: null [2025-03-17 11:18:22,852 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:18:22,852 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:18:22,864 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:18:22,864 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:18:22,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:18:22 BoogieIcfgContainer [2025-03-17 11:18:22,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:18:22,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:18:22,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:18:22,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:18:22,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:18:22" (1/3) ... [2025-03-17 11:18:22,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f13ff82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:18:22, skipping insertion in model container [2025-03-17 11:18:22,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:22" (2/3) ... [2025-03-17 11:18:22,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f13ff82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:18:22, skipping insertion in model container [2025-03-17 11:18:22,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:18:22" (3/3) ... [2025-03-17 11:18:22,872 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-2.i [2025-03-17 11:18:22,882 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:18:22,883 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-const-race-2.i that has 2 procedures, 74 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-17 11:18:22,883 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:18:22,929 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 11:18:22,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 75 transitions, 157 flow [2025-03-17 11:18:22,996 INFO L124 PetriNetUnfolderBase]: 1/108 cut-off events. [2025-03-17 11:18:22,997 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:18:23,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 1/108 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 221 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 2. Up to 3 conditions per place. [2025-03-17 11:18:23,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 75 transitions, 157 flow [2025-03-17 11:18:23,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 75 transitions, 157 flow [2025-03-17 11:18:23,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:18:23,018 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=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;@1926a005, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:18:23,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 11:18:23,034 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:18:23,034 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-17 11:18:23,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:18:23,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:23,036 INFO L206 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] [2025-03-17 11:18:23,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:18:23,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:23,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1621033863, now seen corresponding path program 1 times [2025-03-17 11:18:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:23,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465631369] [2025-03-17 11:18:23,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:23,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:18:23,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:18:23,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:23,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:23,229 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-17 11:18:23,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:23,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465631369] [2025-03-17 11:18:23,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465631369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:23,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:23,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:18:23,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831031184] [2025-03-17 11:18:23,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:23,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:18:23,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:23,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:18:23,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:18:23,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 75 [2025-03-17 11:18:23,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 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-17 11:18:23,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:23,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 75 [2025-03-17 11:18:23,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:23,372 INFO L124 PetriNetUnfolderBase]: 8/185 cut-off events. [2025-03-17 11:18:23,372 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:18:23,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 185 events. 8/185 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 576 event pairs, 0 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 155. Up to 17 conditions per place. [2025-03-17 11:18:23,375 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 10 selfloop transitions, 4 changer transitions 1/79 dead transitions. [2025-03-17 11:18:23,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 195 flow [2025-03-17 11:18:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:18:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:18:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2025-03-17 11:18:23,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2025-03-17 11:18:23,388 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 157 flow. Second operand 4 states and 272 transitions. [2025-03-17 11:18:23,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 195 flow [2025-03-17 11:18:23,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 195 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:23,395 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 169 flow [2025-03-17 11:18:23,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-03-17 11:18:23,401 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-03-17 11:18:23,401 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 169 flow [2025-03-17 11:18:23,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 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-17 11:18:23,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:23,402 INFO L206 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] [2025-03-17 11:18:23,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:18:23,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:18:23,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1640805826, now seen corresponding path program 1 times [2025-03-17 11:18:23,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:23,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49201162] [2025-03-17 11:18:23,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:23,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:18:23,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:18:23,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:23,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:23,748 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-17 11:18:23,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:23,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49201162] [2025-03-17 11:18:23,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49201162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:23,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:23,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:23,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131577460] [2025-03-17 11:18:23,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:23,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:23,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:23,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:23,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:23,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 75 [2025-03-17 11:18:23,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 53.5) internal successors, (321), 6 states have internal predecessors, (321), 0 states have call successors, (0), 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-17 11:18:23,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:23,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 75 [2025-03-17 11:18:23,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:23,949 INFO L124 PetriNetUnfolderBase]: 30/233 cut-off events. [2025-03-17 11:18:23,949 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-17 11:18:23,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 233 events. 30/233 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 950 event pairs, 4 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 273. Up to 62 conditions per place. [2025-03-17 11:18:23,950 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 25 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2025-03-17 11:18:23,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 243 flow [2025-03-17 11:18:23,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 343 transitions. [2025-03-17 11:18:23,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7622222222222222 [2025-03-17 11:18:23,952 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 169 flow. Second operand 6 states and 343 transitions. [2025-03-17 11:18:23,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 243 flow [2025-03-17 11:18:23,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 82 transitions, 235 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 11:18:23,954 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 169 flow [2025-03-17 11:18:23,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2025-03-17 11:18:23,955 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-03-17 11:18:23,955 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 169 flow [2025-03-17 11:18:23,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.5) internal successors, (321), 6 states have internal predecessors, (321), 0 states have call successors, (0), 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-17 11:18:23,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:23,955 INFO L206 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] [2025-03-17 11:18:23,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:18:23,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:18:23,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash -573155467, now seen corresponding path program 1 times [2025-03-17 11:18:23,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:23,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572509006] [2025-03-17 11:18:23,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:23,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:23,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:18:23,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:18:23,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:23,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:23,988 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-17 11:18:23,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:23,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572509006] [2025-03-17 11:18:23,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572509006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:23,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:23,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:23,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886293790] [2025-03-17 11:18:23,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:23,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:23,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:23,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:23,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:23,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 75 [2025-03-17 11:18:24,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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-17 11:18:24,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:24,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 75 [2025-03-17 11:18:24,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:24,024 INFO L124 PetriNetUnfolderBase]: 6/141 cut-off events. [2025-03-17 11:18:24,024 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2025-03-17 11:18:24,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 141 events. 6/141 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 383 event pairs, 4 based on Foata normal form. 1/130 useless extension candidates. Maximal degree in co-relation 134. Up to 21 conditions per place. [2025-03-17 11:18:24,025 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 9 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-03-17 11:18:24,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 77 transitions, 201 flow [2025-03-17 11:18:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-03-17 11:18:24,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288888888888889 [2025-03-17 11:18:24,027 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 169 flow. Second operand 3 states and 209 transitions. [2025-03-17 11:18:24,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 77 transitions, 201 flow [2025-03-17 11:18:24,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 77 transitions, 191 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:18:24,028 INFO L231 Difference]: Finished difference. Result has 81 places, 77 transitions, 189 flow [2025-03-17 11:18:24,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2025-03-17 11:18:24,029 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-03-17 11:18:24,029 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 189 flow [2025-03-17 11:18:24,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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-17 11:18:24,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:24,033 INFO L206 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] [2025-03-17 11:18:24,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:18:24,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:18:24,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1417842107, now seen corresponding path program 1 times [2025-03-17 11:18:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:24,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281210655] [2025-03-17 11:18:24,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:24,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:24,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:18:24,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:18:24,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:24,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:24,085 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-17 11:18:24,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:24,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281210655] [2025-03-17 11:18:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281210655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:24,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:24,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:18:24,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000752278] [2025-03-17 11:18:24,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:24,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:18:24,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:24,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:18:24,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:18:24,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 75 [2025-03-17 11:18:24,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 0 states have call successors, (0), 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-17 11:18:24,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:24,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 75 [2025-03-17 11:18:24,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:24,136 INFO L124 PetriNetUnfolderBase]: 2/106 cut-off events. [2025-03-17 11:18:24,136 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:18:24,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 106 events. 2/106 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 155 event pairs, 0 based on Foata normal form. 3/104 useless extension candidates. Maximal degree in co-relation 82. Up to 7 conditions per place. [2025-03-17 11:18:24,137 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 9 selfloop transitions, 3 changer transitions 7/75 dead transitions. [2025-03-17 11:18:24,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 75 transitions, 199 flow [2025-03-17 11:18:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:18:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:18:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2025-03-17 11:18:24,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9 [2025-03-17 11:18:24,138 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 189 flow. Second operand 4 states and 270 transitions. [2025-03-17 11:18:24,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 75 transitions, 199 flow [2025-03-17 11:18:24,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 187 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-17 11:18:24,139 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 153 flow [2025-03-17 11:18:24,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2025-03-17 11:18:24,140 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-03-17 11:18:24,140 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 153 flow [2025-03-17 11:18:24,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 0 states have call successors, (0), 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-17 11:18:24,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:24,140 INFO L206 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] [2025-03-17 11:18:24,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:18:24,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:18:24,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:24,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1927503441, now seen corresponding path program 1 times [2025-03-17 11:18:24,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:24,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888625856] [2025-03-17 11:18:24,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:24,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:24,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:18:24,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:18:24,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:24,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:18:24,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:24,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888625856] [2025-03-17 11:18:24,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888625856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:24,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:24,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:18:24,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233618942] [2025-03-17 11:18:24,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:24,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:24,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:24,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:24,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 75 [2025-03-17 11:18:24,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 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-17 11:18:24,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:24,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 75 [2025-03-17 11:18:24,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:24,360 INFO L124 PetriNetUnfolderBase]: 6/87 cut-off events. [2025-03-17 11:18:24,363 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:18:24,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 87 events. 6/87 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 144 event pairs, 0 based on Foata normal form. 3/89 useless extension candidates. Maximal degree in co-relation 114. Up to 5 conditions per place. [2025-03-17 11:18:24,363 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 10 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-03-17 11:18:24,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 146 flow [2025-03-17 11:18:24,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:18:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 11:18:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 450 transitions. [2025-03-17 11:18:24,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-03-17 11:18:24,365 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 153 flow. Second operand 7 states and 450 transitions. [2025-03-17 11:18:24,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 146 flow [2025-03-17 11:18:24,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:24,368 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 111 flow [2025-03-17 11:18:24,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-03-17 11:18:24,368 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -18 predicate places. [2025-03-17 11:18:24,368 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 111 flow [2025-03-17 11:18:24,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 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-17 11:18:24,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:24,369 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:24,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:18:24,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:18:24,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:24,369 INFO L85 PathProgramCache]: Analyzing trace with hash 324870992, now seen corresponding path program 1 times [2025-03-17 11:18:24,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:24,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137970624] [2025-03-17 11:18:24,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:24,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:24,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 11:18:24,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:18:24,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:24,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:18:24,389 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:18:24,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 11:18:24,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:18:24,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:24,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:18:24,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:18:24,413 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:18:24,413 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-17 11:18:24,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-03-17 11:18:24,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-03-17 11:18:24,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-03-17 11:18:24,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-03-17 11:18:24,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-03-17 11:18:24,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:18:24,417 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 11:18:24,418 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:18:24,418 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 11:18:24,433 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:18:24,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 93 transitions, 202 flow [2025-03-17 11:18:24,449 INFO L124 PetriNetUnfolderBase]: 3/190 cut-off events. [2025-03-17 11:18:24,449 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:18:24,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 190 events. 3/190 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 455 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 110. Up to 6 conditions per place. [2025-03-17 11:18:24,450 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 93 transitions, 202 flow [2025-03-17 11:18:24,451 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 93 transitions, 202 flow [2025-03-17 11:18:24,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:18:24,452 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=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;@1926a005, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:18:24,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 11:18:24,456 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:18:24,458 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-17 11:18:24,458 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:18:24,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:24,458 INFO L206 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] [2025-03-17 11:18:24,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:24,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash 90252377, now seen corresponding path program 1 times [2025-03-17 11:18:24,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:24,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161007005] [2025-03-17 11:18:24,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:24,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:24,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:18:24,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:18:24,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:24,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:24,502 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-17 11:18:24,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:24,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161007005] [2025-03-17 11:18:24,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161007005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:24,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:24,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:18:24,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296478719] [2025-03-17 11:18:24,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:24,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:18:24,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:24,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:18:24,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:18:24,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-03-17 11:18:24,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 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-17 11:18:24,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:24,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-03-17 11:18:24,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:24,603 INFO L124 PetriNetUnfolderBase]: 72/571 cut-off events. [2025-03-17 11:18:24,603 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-17 11:18:24,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 571 events. 72/571 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3303 event pairs, 35 based on Foata normal form. 1/523 useless extension candidates. Maximal degree in co-relation 336. Up to 106 conditions per place. [2025-03-17 11:18:24,607 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 18 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2025-03-17 11:18:24,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 100 transitions, 260 flow [2025-03-17 11:18:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:18:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:18:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 335 transitions. [2025-03-17 11:18:24,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9005376344086021 [2025-03-17 11:18:24,610 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 202 flow. Second operand 4 states and 335 transitions. [2025-03-17 11:18:24,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 100 transitions, 260 flow [2025-03-17 11:18:24,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 100 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:24,612 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 218 flow [2025-03-17 11:18:24,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2025-03-17 11:18:24,613 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 4 predicate places. [2025-03-17 11:18:24,613 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 218 flow [2025-03-17 11:18:24,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 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-17 11:18:24,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:24,613 INFO L206 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] [2025-03-17 11:18:24,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:18:24,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:24,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:24,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1307470495, now seen corresponding path program 1 times [2025-03-17 11:18:24,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:24,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721378656] [2025-03-17 11:18:24,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:24,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:24,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:18:24,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:18:24,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:24,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:24,807 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-17 11:18:24,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:24,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721378656] [2025-03-17 11:18:24,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721378656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:24,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:24,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:24,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894943284] [2025-03-17 11:18:24,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:24,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:24,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:24,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:24,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:24,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 93 [2025-03-17 11:18:24,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 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-17 11:18:24,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:24,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 93 [2025-03-17 11:18:24,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:25,019 INFO L124 PetriNetUnfolderBase]: 236/941 cut-off events. [2025-03-17 11:18:25,020 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-17 11:18:25,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 941 events. 236/941 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6507 event pairs, 91 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 443. Up to 313 conditions per place. [2025-03-17 11:18:25,025 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 38 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2025-03-17 11:18:25,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 109 transitions, 334 flow [2025-03-17 11:18:25,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2025-03-17 11:18:25,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7867383512544803 [2025-03-17 11:18:25,030 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 218 flow. Second operand 6 states and 439 transitions. [2025-03-17 11:18:25,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 109 transitions, 334 flow [2025-03-17 11:18:25,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 109 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:25,032 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 220 flow [2025-03-17 11:18:25,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2025-03-17 11:18:25,032 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 6 predicate places. [2025-03-17 11:18:25,032 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 220 flow [2025-03-17 11:18:25,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 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-17 11:18:25,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:25,035 INFO L206 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] [2025-03-17 11:18:25,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:18:25,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:25,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1536911326, now seen corresponding path program 1 times [2025-03-17 11:18:25,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:25,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862481354] [2025-03-17 11:18:25,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:25,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:25,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:18:25,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:18:25,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:25,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:25,069 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-17 11:18:25,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:25,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862481354] [2025-03-17 11:18:25,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862481354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:25,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:25,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:25,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728451511] [2025-03-17 11:18:25,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:25,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:25,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:25,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:25,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:25,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-03-17 11:18:25,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-17 11:18:25,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:25,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-03-17 11:18:25,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:25,170 INFO L124 PetriNetUnfolderBase]: 116/707 cut-off events. [2025-03-17 11:18:25,170 INFO L125 PetriNetUnfolderBase]: For 120/165 co-relation queries the response was YES. [2025-03-17 11:18:25,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 707 events. 116/707 cut-off events. For 120/165 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4584 event pairs, 58 based on Foata normal form. 4/621 useless extension candidates. Maximal degree in co-relation 463. Up to 185 conditions per place. [2025-03-17 11:18:25,175 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 18 selfloop transitions, 5 changer transitions 0/101 dead transitions. [2025-03-17 11:18:25,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 290 flow [2025-03-17 11:18:25,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:25,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2025-03-17 11:18:25,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2025-03-17 11:18:25,176 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 220 flow. Second operand 3 states and 258 transitions. [2025-03-17 11:18:25,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 290 flow [2025-03-17 11:18:25,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 101 transitions, 280 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:18:25,178 INFO L231 Difference]: Finished difference. Result has 101 places, 97 transitions, 248 flow [2025-03-17 11:18:25,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=101, PETRI_TRANSITIONS=97} [2025-03-17 11:18:25,179 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 5 predicate places. [2025-03-17 11:18:25,179 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 97 transitions, 248 flow [2025-03-17 11:18:25,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-17 11:18:25,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:25,179 INFO L206 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] [2025-03-17 11:18:25,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:18:25,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:25,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:25,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1281204440, now seen corresponding path program 1 times [2025-03-17 11:18:25,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:25,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998521472] [2025-03-17 11:18:25,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:25,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:25,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:18:25,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:18:25,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:25,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:25,226 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-17 11:18:25,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:25,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998521472] [2025-03-17 11:18:25,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998521472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:25,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:25,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:18:25,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213652045] [2025-03-17 11:18:25,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:25,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:18:25,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:25,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:18:25,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:18:25,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-03-17 11:18:25,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 97 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 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-17 11:18:25,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:25,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-03-17 11:18:25,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:25,338 INFO L124 PetriNetUnfolderBase]: 63/580 cut-off events. [2025-03-17 11:18:25,339 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-17 11:18:25,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 580 events. 63/580 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3186 event pairs, 24 based on Foata normal form. 15/544 useless extension candidates. Maximal degree in co-relation 632. Up to 72 conditions per place. [2025-03-17 11:18:25,342 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 19 selfloop transitions, 4 changer transitions 3/108 dead transitions. [2025-03-17 11:18:25,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 108 transitions, 328 flow [2025-03-17 11:18:25,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:18:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:18:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 339 transitions. [2025-03-17 11:18:25,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9112903225806451 [2025-03-17 11:18:25,344 INFO L175 Difference]: Start difference. First operand has 101 places, 97 transitions, 248 flow. Second operand 4 states and 339 transitions. [2025-03-17 11:18:25,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 108 transitions, 328 flow [2025-03-17 11:18:25,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 108 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:25,348 INFO L231 Difference]: Finished difference. Result has 103 places, 98 transitions, 254 flow [2025-03-17 11:18:25,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=103, PETRI_TRANSITIONS=98} [2025-03-17 11:18:25,350 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 7 predicate places. [2025-03-17 11:18:25,351 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 98 transitions, 254 flow [2025-03-17 11:18:25,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 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-17 11:18:25,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:25,351 INFO L206 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] [2025-03-17 11:18:25,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:18:25,351 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:25,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:25,352 INFO L85 PathProgramCache]: Analyzing trace with hash 714662529, now seen corresponding path program 1 times [2025-03-17 11:18:25,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:25,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367454819] [2025-03-17 11:18:25,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:25,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:25,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:18:25,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:18:25,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:25,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:25,429 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-17 11:18:25,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:25,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367454819] [2025-03-17 11:18:25,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367454819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:25,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:25,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:18:25,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869216186] [2025-03-17 11:18:25,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:25,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:25,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:25,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:25,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:25,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 93 [2025-03-17 11:18:25,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 98 transitions, 254 flow. Second operand has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 0 states have call successors, (0), 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-17 11:18:25,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:25,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 93 [2025-03-17 11:18:25,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:25,645 INFO L124 PetriNetUnfolderBase]: 111/852 cut-off events. [2025-03-17 11:18:25,645 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-03-17 11:18:25,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 852 events. 111/852 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5378 event pairs, 21 based on Foata normal form. 3/781 useless extension candidates. Maximal degree in co-relation 742. Up to 125 conditions per place. [2025-03-17 11:18:25,649 INFO L140 encePairwiseOnDemand]: 86/93 looper letters, 24 selfloop transitions, 7 changer transitions 3/114 dead transitions. [2025-03-17 11:18:25,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 114 transitions, 354 flow [2025-03-17 11:18:25,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:18:25,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 11:18:25,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 567 transitions. [2025-03-17 11:18:25,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8709677419354839 [2025-03-17 11:18:25,651 INFO L175 Difference]: Start difference. First operand has 103 places, 98 transitions, 254 flow. Second operand 7 states and 567 transitions. [2025-03-17 11:18:25,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 114 transitions, 354 flow [2025-03-17 11:18:25,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 114 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:25,654 INFO L231 Difference]: Finished difference. Result has 110 places, 100 transitions, 278 flow [2025-03-17 11:18:25,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=110, PETRI_TRANSITIONS=100} [2025-03-17 11:18:25,654 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 14 predicate places. [2025-03-17 11:18:25,654 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 100 transitions, 278 flow [2025-03-17 11:18:25,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 0 states have call successors, (0), 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-17 11:18:25,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:25,655 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:25,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:18:25,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:25,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash -351990046, now seen corresponding path program 1 times [2025-03-17 11:18:25,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:25,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883566704] [2025-03-17 11:18:25,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:25,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:25,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:18:25,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:18:25,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:25,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:25,704 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-17 11:18:25,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:25,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883566704] [2025-03-17 11:18:25,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883566704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:25,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:25,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:25,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971264895] [2025-03-17 11:18:25,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:25,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:25,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:25,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:25,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:25,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-03-17 11:18:25,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 100 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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-17 11:18:25,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:25,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-03-17 11:18:25,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:25,785 INFO L124 PetriNetUnfolderBase]: 58/570 cut-off events. [2025-03-17 11:18:25,785 INFO L125 PetriNetUnfolderBase]: For 156/208 co-relation queries the response was YES. [2025-03-17 11:18:25,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 570 events. 58/570 cut-off events. For 156/208 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3265 event pairs, 32 based on Foata normal form. 3/527 useless extension candidates. Maximal degree in co-relation 758. Up to 111 conditions per place. [2025-03-17 11:18:25,789 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 18 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2025-03-17 11:18:25,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 107 transitions, 347 flow [2025-03-17 11:18:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2025-03-17 11:18:25,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.921146953405018 [2025-03-17 11:18:25,790 INFO L175 Difference]: Start difference. First operand has 110 places, 100 transitions, 278 flow. Second operand 3 states and 257 transitions. [2025-03-17 11:18:25,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 107 transitions, 347 flow [2025-03-17 11:18:25,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 337 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-17 11:18:25,793 INFO L231 Difference]: Finished difference. Result has 111 places, 104 transitions, 314 flow [2025-03-17 11:18:25,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=111, PETRI_TRANSITIONS=104} [2025-03-17 11:18:25,793 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 15 predicate places. [2025-03-17 11:18:25,793 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 314 flow [2025-03-17 11:18:25,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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-17 11:18:25,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:25,794 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-17 11:18:25,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:18:25,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:25,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1448181201, now seen corresponding path program 1 times [2025-03-17 11:18:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:25,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219361236] [2025-03-17 11:18:25,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:25,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:25,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 11:18:25,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:18:25,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:25,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:25,928 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-17 11:18:25,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:25,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219361236] [2025-03-17 11:18:25,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219361236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:25,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:25,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:18:25,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620842161] [2025-03-17 11:18:25,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:25,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:18:25,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:25,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:18:25,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:18:25,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 93 [2025-03-17 11:18:25,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 104 transitions, 314 flow. Second operand has 8 states, 8 states have (on average 77.625) internal successors, (621), 8 states have internal predecessors, (621), 0 states have call successors, (0), 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-17 11:18:25,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:25,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 93 [2025-03-17 11:18:25,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:26,107 INFO L124 PetriNetUnfolderBase]: 71/470 cut-off events. [2025-03-17 11:18:26,108 INFO L125 PetriNetUnfolderBase]: For 93/97 co-relation queries the response was YES. [2025-03-17 11:18:26,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 470 events. 71/470 cut-off events. For 93/97 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2515 event pairs, 1 based on Foata normal form. 14/473 useless extension candidates. Maximal degree in co-relation 741. Up to 32 conditions per place. [2025-03-17 11:18:26,112 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 25 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2025-03-17 11:18:26,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 328 flow [2025-03-17 11:18:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:18:26,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:18:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 794 transitions. [2025-03-17 11:18:26,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.853763440860215 [2025-03-17 11:18:26,114 INFO L175 Difference]: Start difference. First operand has 111 places, 104 transitions, 314 flow. Second operand 10 states and 794 transitions. [2025-03-17 11:18:26,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 328 flow [2025-03-17 11:18:26,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 93 transitions, 314 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:18:26,116 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 228 flow [2025-03-17 11:18:26,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=228, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2025-03-17 11:18:26,117 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -5 predicate places. [2025-03-17 11:18:26,117 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 228 flow [2025-03-17 11:18:26,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 77.625) internal successors, (621), 8 states have internal predecessors, (621), 0 states have call successors, (0), 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-17 11:18:26,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:26,118 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:26,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:18:26,118 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-17 11:18:26,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:26,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1649216451, now seen corresponding path program 1 times [2025-03-17 11:18:26,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:26,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145653931] [2025-03-17 11:18:26,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:26,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:26,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 11:18:26,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 11:18:26,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:26,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:18:26,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:18:26,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 11:18:26,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 11:18:26,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:26,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:18:26,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:18:26,156 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:18:26,156 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-17 11:18:26,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-17 11:18:26,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-17 11:18:26,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-17 11:18:26,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-17 11:18:26,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-17 11:18:26,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-17 11:18:26,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:18:26,157 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:26,157 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:18:26,157 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 11:18:26,169 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:18:26,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 111 transitions, 249 flow [2025-03-17 11:18:26,190 INFO L124 PetriNetUnfolderBase]: 8/319 cut-off events. [2025-03-17 11:18:26,190 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-17 11:18:26,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 319 events. 8/319 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 925 event pairs, 1 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 198. Up to 12 conditions per place. [2025-03-17 11:18:26,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 111 transitions, 249 flow [2025-03-17 11:18:26,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 111 transitions, 249 flow [2025-03-17 11:18:26,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:18:26,194 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=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;@1926a005, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:18:26,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 11:18:26,196 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:18:26,196 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-17 11:18:26,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:18:26,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:26,196 INFO L206 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] [2025-03-17 11:18:26,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:26,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:26,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1746569991, now seen corresponding path program 1 times [2025-03-17 11:18:26,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:26,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985231917] [2025-03-17 11:18:26,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:26,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:26,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:18:26,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:18:26,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:26,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:26,227 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-17 11:18:26,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:26,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985231917] [2025-03-17 11:18:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985231917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:26,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:26,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:18:26,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653393176] [2025-03-17 11:18:26,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:26,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:18:26,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:26,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:18:26,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:18:26,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2025-03-17 11:18:26,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 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-17 11:18:26,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:26,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2025-03-17 11:18:26,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:26,453 INFO L124 PetriNetUnfolderBase]: 413/2179 cut-off events. [2025-03-17 11:18:26,454 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2025-03-17 11:18:26,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2953 conditions, 2179 events. 413/2179 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 17344 event pairs, 232 based on Foata normal form. 1/1993 useless extension candidates. Maximal degree in co-relation 1327. Up to 496 conditions per place. [2025-03-17 11:18:26,469 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 24 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-03-17 11:18:26,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 120 transitions, 323 flow [2025-03-17 11:18:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:18:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:18:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2025-03-17 11:18:26,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8941441441441441 [2025-03-17 11:18:26,474 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 249 flow. Second operand 4 states and 397 transitions. [2025-03-17 11:18:26,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 120 transitions, 323 flow [2025-03-17 11:18:26,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 323 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:26,477 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 265 flow [2025-03-17 11:18:26,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=265, PETRI_PLACES=119, PETRI_TRANSITIONS=112} [2025-03-17 11:18:26,478 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 4 predicate places. [2025-03-17 11:18:26,478 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 112 transitions, 265 flow [2025-03-17 11:18:26,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 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-17 11:18:26,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:26,479 INFO L206 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] [2025-03-17 11:18:26,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:18:26,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:26,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1584233330, now seen corresponding path program 1 times [2025-03-17 11:18:26,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:26,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833059099] [2025-03-17 11:18:26,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:26,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:26,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:18:26,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:18:26,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:26,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:26,630 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-17 11:18:26,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:26,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833059099] [2025-03-17 11:18:26,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833059099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:26,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:26,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:26,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735988690] [2025-03-17 11:18:26,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:26,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:26,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:26,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:26,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:26,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 111 [2025-03-17 11:18:26,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 112 transitions, 265 flow. Second operand has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 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-17 11:18:26,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:26,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 111 [2025-03-17 11:18:26,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:27,058 INFO L124 PetriNetUnfolderBase]: 1292/3939 cut-off events. [2025-03-17 11:18:27,058 INFO L125 PetriNetUnfolderBase]: For 316/316 co-relation queries the response was YES. [2025-03-17 11:18:27,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6288 conditions, 3939 events. 1292/3939 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 34618 event pairs, 412 based on Foata normal form. 0/3678 useless extension candidates. Maximal degree in co-relation 5573. Up to 1483 conditions per place. [2025-03-17 11:18:27,080 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 50 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2025-03-17 11:18:27,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 135 transitions, 421 flow [2025-03-17 11:18:27,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2025-03-17 11:18:27,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8033033033033034 [2025-03-17 11:18:27,084 INFO L175 Difference]: Start difference. First operand has 119 places, 112 transitions, 265 flow. Second operand 6 states and 535 transitions. [2025-03-17 11:18:27,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 135 transitions, 421 flow [2025-03-17 11:18:27,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 135 transitions, 415 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:27,087 INFO L231 Difference]: Finished difference. Result has 121 places, 111 transitions, 267 flow [2025-03-17 11:18:27,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=121, PETRI_TRANSITIONS=111} [2025-03-17 11:18:27,088 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 6 predicate places. [2025-03-17 11:18:27,088 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 111 transitions, 267 flow [2025-03-17 11:18:27,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 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-17 11:18:27,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:27,089 INFO L206 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] [2025-03-17 11:18:27,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:18:27,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:27,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:27,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1540101439, now seen corresponding path program 1 times [2025-03-17 11:18:27,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:27,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026923131] [2025-03-17 11:18:27,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:27,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:27,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:18:27,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:18:27,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:27,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:27,112 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-17 11:18:27,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:27,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026923131] [2025-03-17 11:18:27,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026923131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:27,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:27,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:27,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448322047] [2025-03-17 11:18:27,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:27,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:27,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:27,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:27,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:27,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2025-03-17 11:18:27,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 111 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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-17 11:18:27,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:27,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2025-03-17 11:18:27,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:27,496 INFO L124 PetriNetUnfolderBase]: 1023/4159 cut-off events. [2025-03-17 11:18:27,496 INFO L125 PetriNetUnfolderBase]: For 676/930 co-relation queries the response was YES. [2025-03-17 11:18:27,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6131 conditions, 4159 events. 1023/4159 cut-off events. For 676/930 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 39785 event pairs, 581 based on Foata normal form. 4/3617 useless extension candidates. Maximal degree in co-relation 2112. Up to 1329 conditions per place. [2025-03-17 11:18:27,518 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 27 selfloop transitions, 6 changer transitions 0/124 dead transitions. [2025-03-17 11:18:27,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 124 transitions, 377 flow [2025-03-17 11:18:27,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2025-03-17 11:18:27,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219219219219219 [2025-03-17 11:18:27,520 INFO L175 Difference]: Start difference. First operand has 121 places, 111 transitions, 267 flow. Second operand 3 states and 307 transitions. [2025-03-17 11:18:27,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 124 transitions, 377 flow [2025-03-17 11:18:27,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 124 transitions, 367 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:18:27,522 INFO L231 Difference]: Finished difference. Result has 120 places, 116 transitions, 303 flow [2025-03-17 11:18:27,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=120, PETRI_TRANSITIONS=116} [2025-03-17 11:18:27,522 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 5 predicate places. [2025-03-17 11:18:27,522 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 116 transitions, 303 flow [2025-03-17 11:18:27,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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-17 11:18:27,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:27,523 INFO L206 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] [2025-03-17 11:18:27,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:18:27,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:27,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:27,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2050657767, now seen corresponding path program 1 times [2025-03-17 11:18:27,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:27,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067165731] [2025-03-17 11:18:27,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:27,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:27,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:18:27,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:18:27,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:27,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:27,561 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-17 11:18:27,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:27,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067165731] [2025-03-17 11:18:27,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067165731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:27,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:27,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:18:27,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969618982] [2025-03-17 11:18:27,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:27,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:18:27,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:27,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:18:27,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:18:27,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2025-03-17 11:18:27,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 116 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 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) [2025-03-17 11:18:27,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:27,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2025-03-17 11:18:27,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:27,845 INFO L124 PetriNetUnfolderBase]: 662/3141 cut-off events. [2025-03-17 11:18:27,846 INFO L125 PetriNetUnfolderBase]: For 430/450 co-relation queries the response was YES. [2025-03-17 11:18:27,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4682 conditions, 3141 events. 662/3141 cut-off events. For 430/450 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 28332 event pairs, 320 based on Foata normal form. 63/2852 useless extension candidates. Maximal degree in co-relation 3788. Up to 540 conditions per place. [2025-03-17 11:18:27,863 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 31 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2025-03-17 11:18:27,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 132 transitions, 414 flow [2025-03-17 11:18:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:18:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:18:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2025-03-17 11:18:27,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2025-03-17 11:18:27,865 INFO L175 Difference]: Start difference. First operand has 120 places, 116 transitions, 303 flow. Second operand 4 states and 404 transitions. [2025-03-17 11:18:27,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 132 transitions, 414 flow [2025-03-17 11:18:27,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 132 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:27,868 INFO L231 Difference]: Finished difference. Result has 122 places, 117 transitions, 307 flow [2025-03-17 11:18:27,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=122, PETRI_TRANSITIONS=117} [2025-03-17 11:18:27,869 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 7 predicate places. [2025-03-17 11:18:27,869 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 117 transitions, 307 flow [2025-03-17 11:18:27,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 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) [2025-03-17 11:18:27,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:27,869 INFO L206 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] [2025-03-17 11:18:27,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:18:27,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:27,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash -767396367, now seen corresponding path program 1 times [2025-03-17 11:18:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:27,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631794559] [2025-03-17 11:18:27,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:27,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:27,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:18:27,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:18:27,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:27,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:18:27,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:27,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631794559] [2025-03-17 11:18:27,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631794559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:27,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:27,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:18:27,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408484343] [2025-03-17 11:18:27,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:27,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:27,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:27,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:27,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:27,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2025-03-17 11:18:27,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 117 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 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-17 11:18:27,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:27,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2025-03-17 11:18:27,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:28,397 INFO L124 PetriNetUnfolderBase]: 950/4761 cut-off events. [2025-03-17 11:18:28,397 INFO L125 PetriNetUnfolderBase]: For 649/649 co-relation queries the response was YES. [2025-03-17 11:18:28,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6986 conditions, 4761 events. 950/4761 cut-off events. For 649/649 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 47742 event pairs, 310 based on Foata normal form. 3/4187 useless extension candidates. Maximal degree in co-relation 3734. Up to 1100 conditions per place. [2025-03-17 11:18:28,417 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 35 selfloop transitions, 7 changer transitions 0/137 dead transitions. [2025-03-17 11:18:28,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 137 transitions, 433 flow [2025-03-17 11:18:28,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:18:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 11:18:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 673 transitions. [2025-03-17 11:18:28,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8661518661518661 [2025-03-17 11:18:28,419 INFO L175 Difference]: Start difference. First operand has 122 places, 117 transitions, 307 flow. Second operand 7 states and 673 transitions. [2025-03-17 11:18:28,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 137 transitions, 433 flow [2025-03-17 11:18:28,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 137 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:28,424 INFO L231 Difference]: Finished difference. Result has 129 places, 120 transitions, 337 flow [2025-03-17 11:18:28,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=129, PETRI_TRANSITIONS=120} [2025-03-17 11:18:28,424 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 14 predicate places. [2025-03-17 11:18:28,424 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 120 transitions, 337 flow [2025-03-17 11:18:28,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 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-17 11:18:28,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:28,425 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:28,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:18:28,425 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:28,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:28,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2106802782, now seen corresponding path program 1 times [2025-03-17 11:18:28,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:28,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086360017] [2025-03-17 11:18:28,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:28,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:28,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:18:28,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:18:28,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:28,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:18:28,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:28,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086360017] [2025-03-17 11:18:28,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086360017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:28,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:28,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:28,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928572063] [2025-03-17 11:18:28,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:28,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:28,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:28,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:28,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:28,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2025-03-17 11:18:28,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 120 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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-17 11:18:28,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:28,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2025-03-17 11:18:28,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:28,762 INFO L124 PetriNetUnfolderBase]: 938/3984 cut-off events. [2025-03-17 11:18:28,762 INFO L125 PetriNetUnfolderBase]: For 1268/1455 co-relation queries the response was YES. [2025-03-17 11:18:28,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6761 conditions, 3984 events. 938/3984 cut-off events. For 1268/1455 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 39500 event pairs, 546 based on Foata normal form. 7/3597 useless extension candidates. Maximal degree in co-relation 6424. Up to 1216 conditions per place. [2025-03-17 11:18:28,782 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 28 selfloop transitions, 9 changer transitions 0/134 dead transitions. [2025-03-17 11:18:28,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 134 transitions, 462 flow [2025-03-17 11:18:28,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2025-03-17 11:18:28,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2025-03-17 11:18:28,783 INFO L175 Difference]: Start difference. First operand has 129 places, 120 transitions, 337 flow. Second operand 3 states and 306 transitions. [2025-03-17 11:18:28,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 134 transitions, 462 flow [2025-03-17 11:18:28,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 134 transitions, 452 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-17 11:18:28,786 INFO L231 Difference]: Finished difference. Result has 130 places, 127 transitions, 403 flow [2025-03-17 11:18:28,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=130, PETRI_TRANSITIONS=127} [2025-03-17 11:18:28,787 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 15 predicate places. [2025-03-17 11:18:28,787 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 127 transitions, 403 flow [2025-03-17 11:18:28,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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-17 11:18:28,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:28,787 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-17 11:18:28,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:18:28,787 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:28,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:28,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1778800160, now seen corresponding path program 1 times [2025-03-17 11:18:28,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:28,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221614093] [2025-03-17 11:18:28,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:28,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:28,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 11:18:28,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:18:28,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:28,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:18:28,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:28,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221614093] [2025-03-17 11:18:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221614093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:28,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:28,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:18:28,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849708974] [2025-03-17 11:18:28,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:28,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:18:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:28,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:18:28,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:18:28,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2025-03-17 11:18:28,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 127 transitions, 403 flow. Second operand has 8 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 0 states have call successors, (0), 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-17 11:18:28,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:28,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2025-03-17 11:18:28,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:29,574 INFO L124 PetriNetUnfolderBase]: 1255/6166 cut-off events. [2025-03-17 11:18:29,575 INFO L125 PetriNetUnfolderBase]: For 1548/2574 co-relation queries the response was YES. [2025-03-17 11:18:29,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9875 conditions, 6166 events. 1255/6166 cut-off events. For 1548/2574 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 65457 event pairs, 161 based on Foata normal form. 16/5425 useless extension candidates. Maximal degree in co-relation 5439. Up to 961 conditions per place. [2025-03-17 11:18:29,613 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 47 selfloop transitions, 10 changer transitions 0/159 dead transitions. [2025-03-17 11:18:29,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 159 transitions, 585 flow [2025-03-17 11:18:29,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:18:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:18:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 958 transitions. [2025-03-17 11:18:29,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.863063063063063 [2025-03-17 11:18:29,617 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 403 flow. Second operand 10 states and 958 transitions. [2025-03-17 11:18:29,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 159 transitions, 585 flow [2025-03-17 11:18:29,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 159 transitions, 567 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:29,624 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 425 flow [2025-03-17 11:18:29,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=425, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2025-03-17 11:18:29,624 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 25 predicate places. [2025-03-17 11:18:29,624 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 425 flow [2025-03-17 11:18:29,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 0 states have call successors, (0), 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-17 11:18:29,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:29,625 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:29,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:18:29,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:29,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:29,626 INFO L85 PathProgramCache]: Analyzing trace with hash -733548682, now seen corresponding path program 1 times [2025-03-17 11:18:29,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:29,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747500672] [2025-03-17 11:18:29,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:29,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:29,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 11:18:29,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 11:18:29,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:29,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:29,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:18:29,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:29,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747500672] [2025-03-17 11:18:29,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747500672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:29,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:29,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:18:29,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186592539] [2025-03-17 11:18:29,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:29,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:29,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:29,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:29,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:29,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 111 [2025-03-17 11:18:29,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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-17 11:18:29,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:29,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 111 [2025-03-17 11:18:29,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:29,799 INFO L124 PetriNetUnfolderBase]: 91/1220 cut-off events. [2025-03-17 11:18:29,799 INFO L125 PetriNetUnfolderBase]: For 292/352 co-relation queries the response was YES. [2025-03-17 11:18:29,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 1220 events. 91/1220 cut-off events. For 292/352 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 8869 event pairs, 48 based on Foata normal form. 20/1135 useless extension candidates. Maximal degree in co-relation 1574. Up to 106 conditions per place. [2025-03-17 11:18:29,804 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 12 selfloop transitions, 6 changer transitions 0/128 dead transitions. [2025-03-17 11:18:29,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 128 transitions, 456 flow [2025-03-17 11:18:29,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2025-03-17 11:18:29,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9459459459459459 [2025-03-17 11:18:29,805 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 425 flow. Second operand 3 states and 315 transitions. [2025-03-17 11:18:29,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 128 transitions, 456 flow [2025-03-17 11:18:29,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 128 transitions, 430 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-17 11:18:29,808 INFO L231 Difference]: Finished difference. Result has 136 places, 123 transitions, 375 flow [2025-03-17 11:18:29,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=136, PETRI_TRANSITIONS=123} [2025-03-17 11:18:29,809 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 21 predicate places. [2025-03-17 11:18:29,809 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 123 transitions, 375 flow [2025-03-17 11:18:29,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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-17 11:18:29,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:29,810 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 11:18:29,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:18:29,810 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:29,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1512535072, now seen corresponding path program 1 times [2025-03-17 11:18:29,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:29,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986223479] [2025-03-17 11:18:29,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:29,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:29,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 11:18:29,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 11:18:29,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:29,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 11:18:29,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:29,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986223479] [2025-03-17 11:18:29,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986223479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:29,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:29,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:29,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818866659] [2025-03-17 11:18:29,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:29,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:29,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:29,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:29,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:29,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2025-03-17 11:18:29,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 123 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:29,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:29,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2025-03-17 11:18:29,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:29,953 INFO L124 PetriNetUnfolderBase]: 177/1401 cut-off events. [2025-03-17 11:18:29,953 INFO L125 PetriNetUnfolderBase]: For 701/749 co-relation queries the response was YES. [2025-03-17 11:18:29,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2420 conditions, 1401 events. 177/1401 cut-off events. For 701/749 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 10822 event pairs, 135 based on Foata normal form. 3/1290 useless extension candidates. Maximal degree in co-relation 2120. Up to 336 conditions per place. [2025-03-17 11:18:29,976 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 23 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2025-03-17 11:18:29,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 128 transitions, 449 flow [2025-03-17 11:18:29,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2025-03-17 11:18:29,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8978978978978979 [2025-03-17 11:18:29,979 INFO L175 Difference]: Start difference. First operand has 136 places, 123 transitions, 375 flow. Second operand 3 states and 299 transitions. [2025-03-17 11:18:29,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 128 transitions, 449 flow [2025-03-17 11:18:29,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 128 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:18:29,981 INFO L231 Difference]: Finished difference. Result has 139 places, 126 transitions, 403 flow [2025-03-17 11:18:29,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=139, PETRI_TRANSITIONS=126} [2025-03-17 11:18:29,982 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 24 predicate places. [2025-03-17 11:18:29,982 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 126 transitions, 403 flow [2025-03-17 11:18:29,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:18:29,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:29,983 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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-17 11:18:29,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:18:29,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:29,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:29,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1140142126, now seen corresponding path program 1 times [2025-03-17 11:18:29,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:29,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740733544] [2025-03-17 11:18:29,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:29,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:29,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 11:18:30,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 11:18:30,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:30,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 11:18:30,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:30,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740733544] [2025-03-17 11:18:30,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740733544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:30,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:30,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:18:30,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300168339] [2025-03-17 11:18:30,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:30,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:18:30,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:30,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:18:30,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:18:30,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 111 [2025-03-17 11:18:30,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 126 transitions, 403 flow. Second operand has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 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-17 11:18:30,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:30,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 111 [2025-03-17 11:18:30,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:30,378 INFO L124 PetriNetUnfolderBase]: 151/816 cut-off events. [2025-03-17 11:18:30,378 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2025-03-17 11:18:30,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 816 events. 151/816 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4749 event pairs, 4 based on Foata normal form. 20/817 useless extension candidates. Maximal degree in co-relation 1481. Up to 88 conditions per place. [2025-03-17 11:18:30,382 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 50 selfloop transitions, 11 changer transitions 0/125 dead transitions. [2025-03-17 11:18:30,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 125 transitions, 498 flow [2025-03-17 11:18:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:18:30,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 11:18:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1219 transitions. [2025-03-17 11:18:30,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8447678447678447 [2025-03-17 11:18:30,384 INFO L175 Difference]: Start difference. First operand has 139 places, 126 transitions, 403 flow. Second operand 13 states and 1219 transitions. [2025-03-17 11:18:30,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 125 transitions, 498 flow [2025-03-17 11:18:30,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 125 transitions, 460 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-03-17 11:18:30,387 INFO L231 Difference]: Finished difference. Result has 112 places, 86 transitions, 246 flow [2025-03-17 11:18:30,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=246, PETRI_PLACES=112, PETRI_TRANSITIONS=86} [2025-03-17 11:18:30,387 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2025-03-17 11:18:30,387 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 86 transitions, 246 flow [2025-03-17 11:18:30,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 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-17 11:18:30,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:30,388 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:30,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:18:30,388 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-17 11:18:30,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:30,389 INFO L85 PathProgramCache]: Analyzing trace with hash -282860837, now seen corresponding path program 1 times [2025-03-17 11:18:30,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:30,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187853569] [2025-03-17 11:18:30,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:30,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:30,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 11:18:30,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 11:18:30,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:30,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:18:30,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:18:30,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 11:18:30,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 11:18:30,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:30,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:18:30,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:18:30,425 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:18:30,426 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-17 11:18:30,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-03-17 11:18:30,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-03-17 11:18:30,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-03-17 11:18:30,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-03-17 11:18:30,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-03-17 11:18:30,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-03-17 11:18:30,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-03-17 11:18:30,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:18:30,427 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:30,428 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:18:30,429 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 11:18:30,447 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 11:18:30,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 129 transitions, 298 flow [2025-03-17 11:18:30,478 INFO L124 PetriNetUnfolderBase]: 21/544 cut-off events. [2025-03-17 11:18:30,478 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-17 11:18:30,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 544 events. 21/544 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2071 event pairs, 6 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 339. Up to 32 conditions per place. [2025-03-17 11:18:30,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 129 transitions, 298 flow [2025-03-17 11:18:30,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 129 transitions, 298 flow [2025-03-17 11:18:30,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:18:30,483 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=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;@1926a005, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:18:30,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-17 11:18:30,484 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:18:30,485 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-17 11:18:30,485 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:18:30,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:30,485 INFO L206 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] [2025-03-17 11:18:30,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:30,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:30,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1458433625, now seen corresponding path program 1 times [2025-03-17 11:18:30,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:30,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378743938] [2025-03-17 11:18:30,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:30,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:30,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:18:30,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:18:30,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:30,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:30,511 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-17 11:18:30,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:30,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378743938] [2025-03-17 11:18:30,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378743938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:30,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:30,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:18:30,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574253635] [2025-03-17 11:18:30,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:30,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:18:30,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:30,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:18:30,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:18:30,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-03-17 11:18:30,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 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) [2025-03-17 11:18:30,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:30,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-03-17 11:18:30,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:31,061 INFO L124 PetriNetUnfolderBase]: 2017/8193 cut-off events. [2025-03-17 11:18:31,061 INFO L125 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2025-03-17 11:18:31,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11594 conditions, 8193 events. 2017/8193 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 83868 event pairs, 1191 based on Foata normal form. 1/7482 useless extension candidates. Maximal degree in co-relation 5267. Up to 2119 conditions per place. [2025-03-17 11:18:31,115 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 30 selfloop transitions, 4 changer transitions 0/140 dead transitions. [2025-03-17 11:18:31,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 140 transitions, 388 flow [2025-03-17 11:18:31,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:18:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:18:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2025-03-17 11:18:31,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8895348837209303 [2025-03-17 11:18:31,116 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 298 flow. Second operand 4 states and 459 transitions. [2025-03-17 11:18:31,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 140 transitions, 388 flow [2025-03-17 11:18:31,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 140 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:31,119 INFO L231 Difference]: Finished difference. Result has 138 places, 130 transitions, 314 flow [2025-03-17 11:18:31,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=138, PETRI_TRANSITIONS=130} [2025-03-17 11:18:31,119 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 4 predicate places. [2025-03-17 11:18:31,120 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 130 transitions, 314 flow [2025-03-17 11:18:31,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 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) [2025-03-17 11:18:31,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:31,120 INFO L206 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] [2025-03-17 11:18:31,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:18:31,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:31,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:31,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1555628943, now seen corresponding path program 1 times [2025-03-17 11:18:31,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:31,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691652916] [2025-03-17 11:18:31,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:31,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:31,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:18:31,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:18:31,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:31,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:31,237 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-17 11:18:31,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:31,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691652916] [2025-03-17 11:18:31,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691652916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:31,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:31,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:31,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287374552] [2025-03-17 11:18:31,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:31,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:31,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:31,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:31,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:31,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 129 [2025-03-17 11:18:31,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 130 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 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-17 11:18:31,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:31,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 129 [2025-03-17 11:18:31,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:32,518 INFO L124 PetriNetUnfolderBase]: 6248/15570 cut-off events. [2025-03-17 11:18:32,519 INFO L125 PetriNetUnfolderBase]: For 1593/1593 co-relation queries the response was YES. [2025-03-17 11:18:32,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25646 conditions, 15570 events. 6248/15570 cut-off events. For 1593/1593 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 158215 event pairs, 808 based on Foata normal form. 0/14524 useless extension candidates. Maximal degree in co-relation 23371. Up to 6781 conditions per place. [2025-03-17 11:18:32,604 INFO L140 encePairwiseOnDemand]: 123/129 looper letters, 62 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2025-03-17 11:18:32,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 161 transitions, 510 flow [2025-03-17 11:18:32,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 631 transitions. [2025-03-17 11:18:32,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8152454780361758 [2025-03-17 11:18:32,606 INFO L175 Difference]: Start difference. First operand has 138 places, 130 transitions, 314 flow. Second operand 6 states and 631 transitions. [2025-03-17 11:18:32,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 161 transitions, 510 flow [2025-03-17 11:18:32,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 161 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:32,616 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 316 flow [2025-03-17 11:18:32,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2025-03-17 11:18:32,617 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 6 predicate places. [2025-03-17 11:18:32,617 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 316 flow [2025-03-17 11:18:32,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 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-17 11:18:32,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:32,618 INFO L206 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] [2025-03-17 11:18:32,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:18:32,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:32,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:32,618 INFO L85 PathProgramCache]: Analyzing trace with hash -58689790, now seen corresponding path program 1 times [2025-03-17 11:18:32,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:32,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201924298] [2025-03-17 11:18:32,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:32,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:32,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:18:32,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:18:32,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:32,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:32,634 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-17 11:18:32,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:32,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201924298] [2025-03-17 11:18:32,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201924298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:32,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:32,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:32,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465135393] [2025-03-17 11:18:32,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:32,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:32,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:32,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:32,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:32,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-03-17 11:18:32,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-17 11:18:32,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:32,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-03-17 11:18:32,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:34,299 INFO L124 PetriNetUnfolderBase]: 7160/22223 cut-off events. [2025-03-17 11:18:34,299 INFO L125 PetriNetUnfolderBase]: For 5010/5524 co-relation queries the response was YES. [2025-03-17 11:18:34,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34212 conditions, 22223 events. 7160/22223 cut-off events. For 5010/5524 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 265489 event pairs, 5035 based on Foata normal form. 10/19775 useless extension candidates. Maximal degree in co-relation 27383. Up to 8447 conditions per place. [2025-03-17 11:18:34,408 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 36 selfloop transitions, 7 changer transitions 0/147 dead transitions. [2025-03-17 11:18:34,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 147 transitions, 468 flow [2025-03-17 11:18:34,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-03-17 11:18:34,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9198966408268734 [2025-03-17 11:18:34,409 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 316 flow. Second operand 3 states and 356 transitions. [2025-03-17 11:18:34,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 147 transitions, 468 flow [2025-03-17 11:18:34,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 147 transitions, 458 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:18:34,414 INFO L231 Difference]: Finished difference. Result has 139 places, 135 transitions, 360 flow [2025-03-17 11:18:34,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=139, PETRI_TRANSITIONS=135} [2025-03-17 11:18:34,414 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 5 predicate places. [2025-03-17 11:18:34,414 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 135 transitions, 360 flow [2025-03-17 11:18:34,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-17 11:18:34,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:34,415 INFO L206 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] [2025-03-17 11:18:34,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:18:34,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:34,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:34,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1471473160, now seen corresponding path program 1 times [2025-03-17 11:18:34,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:34,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258781821] [2025-03-17 11:18:34,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:34,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:34,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:18:34,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:18:34,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:34,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:34,442 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-17 11:18:34,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:34,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258781821] [2025-03-17 11:18:34,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258781821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:34,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:34,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:18:34,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702132456] [2025-03-17 11:18:34,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:34,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:18:34,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:34,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:18:34,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:18:34,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-03-17 11:18:34,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 135 transitions, 360 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 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-17 11:18:34,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:34,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-03-17 11:18:34,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:36,229 INFO L124 PetriNetUnfolderBase]: 4968/18140 cut-off events. [2025-03-17 11:18:36,230 INFO L125 PetriNetUnfolderBase]: For 2733/2797 co-relation queries the response was YES. [2025-03-17 11:18:36,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28074 conditions, 18140 events. 4968/18140 cut-off events. For 2733/2797 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 220627 event pairs, 2078 based on Foata normal form. 259/16274 useless extension candidates. Maximal degree in co-relation 22754. Up to 3640 conditions per place. [2025-03-17 11:18:36,360 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 40 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2025-03-17 11:18:36,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 156 transitions, 502 flow [2025-03-17 11:18:36,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:18:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:18:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2025-03-17 11:18:36,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9089147286821705 [2025-03-17 11:18:36,361 INFO L175 Difference]: Start difference. First operand has 139 places, 135 transitions, 360 flow. Second operand 4 states and 469 transitions. [2025-03-17 11:18:36,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 156 transitions, 502 flow [2025-03-17 11:18:36,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 156 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:36,371 INFO L231 Difference]: Finished difference. Result has 141 places, 136 transitions, 362 flow [2025-03-17 11:18:36,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=362, PETRI_PLACES=141, PETRI_TRANSITIONS=136} [2025-03-17 11:18:36,372 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 7 predicate places. [2025-03-17 11:18:36,372 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 136 transitions, 362 flow [2025-03-17 11:18:36,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 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-17 11:18:36,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:36,373 INFO L206 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] [2025-03-17 11:18:36,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:18:36,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:36,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:36,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1776294049, now seen corresponding path program 1 times [2025-03-17 11:18:36,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:36,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36179835] [2025-03-17 11:18:36,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:36,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:36,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:18:36,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:18:36,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:36,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:36,448 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-17 11:18:36,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:36,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36179835] [2025-03-17 11:18:36,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36179835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:36,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:36,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:18:36,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651816099] [2025-03-17 11:18:36,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:36,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:36,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:36,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:36,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:36,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-03-17 11:18:36,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 136 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 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-17 11:18:36,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:36,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-03-17 11:18:36,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:38,343 INFO L124 PetriNetUnfolderBase]: 6364/23537 cut-off events. [2025-03-17 11:18:38,343 INFO L125 PetriNetUnfolderBase]: For 3160/3160 co-relation queries the response was YES. [2025-03-17 11:18:38,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35945 conditions, 23537 events. 6364/23537 cut-off events. For 3160/3160 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 297985 event pairs, 2751 based on Foata normal form. 3/20176 useless extension candidates. Maximal degree in co-relation 20507. Up to 5703 conditions per place. [2025-03-17 11:18:38,488 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 41 selfloop transitions, 7 changer transitions 0/158 dead transitions. [2025-03-17 11:18:38,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 158 transitions, 504 flow [2025-03-17 11:18:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:18:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 11:18:38,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2025-03-17 11:18:38,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8604651162790697 [2025-03-17 11:18:38,490 INFO L175 Difference]: Start difference. First operand has 141 places, 136 transitions, 362 flow. Second operand 7 states and 777 transitions. [2025-03-17 11:18:38,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 158 transitions, 504 flow [2025-03-17 11:18:38,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 158 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:38,497 INFO L231 Difference]: Finished difference. Result has 148 places, 139 transitions, 392 flow [2025-03-17 11:18:38,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=392, PETRI_PLACES=148, PETRI_TRANSITIONS=139} [2025-03-17 11:18:38,497 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 14 predicate places. [2025-03-17 11:18:38,497 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 139 transitions, 392 flow [2025-03-17 11:18:38,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 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-17 11:18:38,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:38,498 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:38,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:18:38,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:38,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:38,498 INFO L85 PathProgramCache]: Analyzing trace with hash 891211506, now seen corresponding path program 1 times [2025-03-17 11:18:38,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:38,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869829753] [2025-03-17 11:18:38,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:38,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:38,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:18:38,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:18:38,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:38,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:38,519 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-17 11:18:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869829753] [2025-03-17 11:18:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869829753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:38,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816778437] [2025-03-17 11:18:38,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:38,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:38,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:38,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:38,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:38,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-03-17 11:18:38,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 139 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-17 11:18:38,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:38,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-03-17 11:18:38,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:41,142 INFO L124 PetriNetUnfolderBase]: 8620/30231 cut-off events. [2025-03-17 11:18:41,142 INFO L125 PetriNetUnfolderBase]: For 11504/13519 co-relation queries the response was YES. [2025-03-17 11:18:41,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51447 conditions, 30231 events. 8620/30231 cut-off events. For 11504/13519 co-relation queries the response was YES. Maximal size of possible extension queue 1075. Compared 395284 event pairs, 4986 based on Foata normal form. 38/26920 useless extension candidates. Maximal degree in co-relation 50164. Up to 9839 conditions per place. [2025-03-17 11:18:41,312 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 38 selfloop transitions, 11 changer transitions 0/159 dead transitions. [2025-03-17 11:18:41,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 159 transitions, 569 flow [2025-03-17 11:18:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2025-03-17 11:18:41,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.917312661498708 [2025-03-17 11:18:41,313 INFO L175 Difference]: Start difference. First operand has 148 places, 139 transitions, 392 flow. Second operand 3 states and 355 transitions. [2025-03-17 11:18:41,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 159 transitions, 569 flow [2025-03-17 11:18:41,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 159 transitions, 559 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-17 11:18:41,338 INFO L231 Difference]: Finished difference. Result has 149 places, 148 transitions, 478 flow [2025-03-17 11:18:41,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=149, PETRI_TRANSITIONS=148} [2025-03-17 11:18:41,338 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 15 predicate places. [2025-03-17 11:18:41,339 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 148 transitions, 478 flow [2025-03-17 11:18:41,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-17 11:18:41,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:41,339 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-17 11:18:41,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:18:41,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:41,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:41,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1067719873, now seen corresponding path program 1 times [2025-03-17 11:18:41,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:41,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038032062] [2025-03-17 11:18:41,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:41,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:41,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 11:18:41,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:18:41,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:41,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:41,414 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-17 11:18:41,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:41,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038032062] [2025-03-17 11:18:41,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038032062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:41,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:41,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:18:41,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092060853] [2025-03-17 11:18:41,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:41,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:18:41,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:41,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:18:41,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:18:41,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-03-17 11:18:41,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 148 transitions, 478 flow. Second operand has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 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-17 11:18:41,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:41,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-03-17 11:18:41,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:45,424 INFO L124 PetriNetUnfolderBase]: 9234/35955 cut-off events. [2025-03-17 11:18:45,424 INFO L125 PetriNetUnfolderBase]: For 10342/19346 co-relation queries the response was YES. [2025-03-17 11:18:45,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59421 conditions, 35955 events. 9234/35955 cut-off events. For 10342/19346 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 495219 event pairs, 2450 based on Foata normal form. 33/30935 useless extension candidates. Maximal degree in co-relation 28392. Up to 8114 conditions per place. [2025-03-17 11:18:45,706 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 55 selfloop transitions, 10 changer transitions 0/184 dead transitions. [2025-03-17 11:18:45,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 184 transitions, 690 flow [2025-03-17 11:18:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:18:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:18:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1106 transitions. [2025-03-17 11:18:45,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8573643410852713 [2025-03-17 11:18:45,708 INFO L175 Difference]: Start difference. First operand has 149 places, 148 transitions, 478 flow. Second operand 10 states and 1106 transitions. [2025-03-17 11:18:45,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 184 transitions, 690 flow [2025-03-17 11:18:45,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 184 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:45,739 INFO L231 Difference]: Finished difference. Result has 159 places, 151 transitions, 504 flow [2025-03-17 11:18:45,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=504, PETRI_PLACES=159, PETRI_TRANSITIONS=151} [2025-03-17 11:18:45,740 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 25 predicate places. [2025-03-17 11:18:45,740 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 151 transitions, 504 flow [2025-03-17 11:18:45,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 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-17 11:18:45,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:45,741 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:45,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:18:45,741 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:45,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:45,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1915963098, now seen corresponding path program 1 times [2025-03-17 11:18:45,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:45,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303261880] [2025-03-17 11:18:45,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:45,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:45,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 11:18:45,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 11:18:45,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:45,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:45,774 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-17 11:18:45,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:45,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303261880] [2025-03-17 11:18:45,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303261880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:45,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:45,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:18:45,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331468562] [2025-03-17 11:18:45,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:45,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:45,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:45,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:45,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:45,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 129 [2025-03-17 11:18:45,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 151 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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-17 11:18:45,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:45,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 129 [2025-03-17 11:18:45,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:46,263 INFO L124 PetriNetUnfolderBase]: 472/4722 cut-off events. [2025-03-17 11:18:46,264 INFO L125 PetriNetUnfolderBase]: For 1435/1689 co-relation queries the response was YES. [2025-03-17 11:18:46,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7181 conditions, 4722 events. 472/4722 cut-off events. For 1435/1689 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 50677 event pairs, 234 based on Foata normal form. 128/4386 useless extension candidates. Maximal degree in co-relation 6326. Up to 454 conditions per place. [2025-03-17 11:18:46,277 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 16 selfloop transitions, 8 changer transitions 0/149 dead transitions. [2025-03-17 11:18:46,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 149 transitions, 545 flow [2025-03-17 11:18:46,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-03-17 11:18:46,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405684754521964 [2025-03-17 11:18:46,277 INFO L175 Difference]: Start difference. First operand has 159 places, 151 transitions, 504 flow. Second operand 3 states and 364 transitions. [2025-03-17 11:18:46,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 149 transitions, 545 flow [2025-03-17 11:18:46,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 149 transitions, 519 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-17 11:18:46,285 INFO L231 Difference]: Finished difference. Result has 155 places, 142 transitions, 440 flow [2025-03-17 11:18:46,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=155, PETRI_TRANSITIONS=142} [2025-03-17 11:18:46,285 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 21 predicate places. [2025-03-17 11:18:46,285 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 142 transitions, 440 flow [2025-03-17 11:18:46,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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-17 11:18:46,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:46,286 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 11:18:46,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:18:46,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:46,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:46,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1873128465, now seen corresponding path program 1 times [2025-03-17 11:18:46,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:46,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170304306] [2025-03-17 11:18:46,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:46,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:46,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 11:18:46,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 11:18:46,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:46,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:46,309 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-17 11:18:46,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:46,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170304306] [2025-03-17 11:18:46,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170304306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:46,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:46,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:46,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178818244] [2025-03-17 11:18:46,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:46,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:46,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:46,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:46,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:46,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-03-17 11:18:46,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 142 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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-17 11:18:46,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:46,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-03-17 11:18:46,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:46,792 INFO L124 PetriNetUnfolderBase]: 934/5912 cut-off events. [2025-03-17 11:18:46,793 INFO L125 PetriNetUnfolderBase]: For 3710/3812 co-relation queries the response was YES. [2025-03-17 11:18:46,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10479 conditions, 5912 events. 934/5912 cut-off events. For 3710/3812 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 66726 event pairs, 666 based on Foata normal form. 4/5388 useless extension candidates. Maximal degree in co-relation 3816. Up to 1548 conditions per place. [2025-03-17 11:18:46,824 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 30 selfloop transitions, 4 changer transitions 0/149 dead transitions. [2025-03-17 11:18:46,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 149 transitions, 544 flow [2025-03-17 11:18:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2025-03-17 11:18:46,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8914728682170543 [2025-03-17 11:18:46,825 INFO L175 Difference]: Start difference. First operand has 155 places, 142 transitions, 440 flow. Second operand 3 states and 345 transitions. [2025-03-17 11:18:46,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 149 transitions, 544 flow [2025-03-17 11:18:46,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 149 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:18:46,829 INFO L231 Difference]: Finished difference. Result has 158 places, 145 transitions, 466 flow [2025-03-17 11:18:46,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=158, PETRI_TRANSITIONS=145} [2025-03-17 11:18:46,829 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 24 predicate places. [2025-03-17 11:18:46,829 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 145 transitions, 466 flow [2025-03-17 11:18:46,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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-17 11:18:46,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:46,829 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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-17 11:18:46,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:18:46,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:46,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:46,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1422834338, now seen corresponding path program 1 times [2025-03-17 11:18:46,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:46,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492672642] [2025-03-17 11:18:46,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:46,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:46,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 11:18:46,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 11:18:46,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:46,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:46,936 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-17 11:18:46,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492672642] [2025-03-17 11:18:46,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492672642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:46,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:46,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:18:46,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821869844] [2025-03-17 11:18:46,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:46,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:18:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:46,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:18:46,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:18:47,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2025-03-17 11:18:47,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 145 transitions, 466 flow. Second operand has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 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-17 11:18:47,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:47,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2025-03-17 11:18:47,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:48,013 INFO L124 PetriNetUnfolderBase]: 1216/8139 cut-off events. [2025-03-17 11:18:48,013 INFO L125 PetriNetUnfolderBase]: For 3460/3688 co-relation queries the response was YES. [2025-03-17 11:18:48,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13552 conditions, 8139 events. 1216/8139 cut-off events. For 3460/3688 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 88338 event pairs, 223 based on Foata normal form. 20/7402 useless extension candidates. Maximal degree in co-relation 5488. Up to 893 conditions per place. [2025-03-17 11:18:48,050 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 76 selfloop transitions, 14 changer transitions 1/203 dead transitions. [2025-03-17 11:18:48,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 203 transitions, 824 flow [2025-03-17 11:18:48,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:18:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 11:18:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1431 transitions. [2025-03-17 11:18:48,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.853309481216458 [2025-03-17 11:18:48,052 INFO L175 Difference]: Start difference. First operand has 158 places, 145 transitions, 466 flow. Second operand 13 states and 1431 transitions. [2025-03-17 11:18:48,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 203 transitions, 824 flow [2025-03-17 11:18:48,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 203 transitions, 812 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:48,059 INFO L231 Difference]: Finished difference. Result has 172 places, 148 transitions, 516 flow [2025-03-17 11:18:48,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=516, PETRI_PLACES=172, PETRI_TRANSITIONS=148} [2025-03-17 11:18:48,059 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 38 predicate places. [2025-03-17 11:18:48,059 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 148 transitions, 516 flow [2025-03-17 11:18:48,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 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-17 11:18:48,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:48,060 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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-17 11:18:48,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:18:48,060 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:48,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:48,061 INFO L85 PathProgramCache]: Analyzing trace with hash 840334849, now seen corresponding path program 1 times [2025-03-17 11:18:48,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:48,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029707144] [2025-03-17 11:18:48,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:48,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 11:18:48,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 11:18:48,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:48,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:48,097 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-17 11:18:48,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:48,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029707144] [2025-03-17 11:18:48,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029707144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:48,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:48,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:48,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858613694] [2025-03-17 11:18:48,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:48,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:48,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:48,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:48,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:48,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-03-17 11:18:48,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 148 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-17 11:18:48,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:48,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-03-17 11:18:48,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:48,819 INFO L124 PetriNetUnfolderBase]: 883/5630 cut-off events. [2025-03-17 11:18:48,819 INFO L125 PetriNetUnfolderBase]: For 4117/4213 co-relation queries the response was YES. [2025-03-17 11:18:48,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10508 conditions, 5630 events. 883/5630 cut-off events. For 4117/4213 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 61520 event pairs, 677 based on Foata normal form. 4/5132 useless extension candidates. Maximal degree in co-relation 9689. Up to 1476 conditions per place. [2025-03-17 11:18:48,853 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 30 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2025-03-17 11:18:48,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 154 transitions, 611 flow [2025-03-17 11:18:48,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2025-03-17 11:18:48,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-03-17 11:18:48,854 INFO L175 Difference]: Start difference. First operand has 172 places, 148 transitions, 516 flow. Second operand 3 states and 344 transitions. [2025-03-17 11:18:48,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 154 transitions, 611 flow [2025-03-17 11:18:48,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 154 transitions, 581 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-03-17 11:18:48,864 INFO L231 Difference]: Finished difference. Result has 168 places, 151 transitions, 522 flow [2025-03-17 11:18:48,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=168, PETRI_TRANSITIONS=151} [2025-03-17 11:18:48,865 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 34 predicate places. [2025-03-17 11:18:48,865 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 151 transitions, 522 flow [2025-03-17 11:18:48,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-17 11:18:48,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:48,865 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 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-17 11:18:48,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 11:18:48,866 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:48,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:48,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2056038174, now seen corresponding path program 1 times [2025-03-17 11:18:48,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:48,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172545935] [2025-03-17 11:18:48,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:48,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:48,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 11:18:48,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 11:18:48,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:48,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:49,140 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-17 11:18:49,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:49,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172545935] [2025-03-17 11:18:49,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172545935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:49,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:49,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:49,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236632937] [2025-03-17 11:18:49,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:49,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:49,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:49,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:49,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:49,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 129 [2025-03-17 11:18:49,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 151 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 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-17 11:18:49,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:49,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 129 [2025-03-17 11:18:49,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:50,605 INFO L124 PetriNetUnfolderBase]: 2726/11128 cut-off events. [2025-03-17 11:18:50,605 INFO L125 PetriNetUnfolderBase]: For 4547/4832 co-relation queries the response was YES. [2025-03-17 11:18:50,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21466 conditions, 11128 events. 2726/11128 cut-off events. For 4547/4832 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 122044 event pairs, 1342 based on Foata normal form. 0/10424 useless extension candidates. Maximal degree in co-relation 19173. Up to 2509 conditions per place. [2025-03-17 11:18:50,648 INFO L140 encePairwiseOnDemand]: 123/129 looper letters, 59 selfloop transitions, 6 changer transitions 0/182 dead transitions. [2025-03-17 11:18:50,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 182 transitions, 746 flow [2025-03-17 11:18:50,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2025-03-17 11:18:50,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8281653746770026 [2025-03-17 11:18:50,649 INFO L175 Difference]: Start difference. First operand has 168 places, 151 transitions, 522 flow. Second operand 6 states and 641 transitions. [2025-03-17 11:18:50,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 182 transitions, 746 flow [2025-03-17 11:18:50,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 182 transitions, 732 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:50,669 INFO L231 Difference]: Finished difference. Result has 170 places, 150 transitions, 518 flow [2025-03-17 11:18:50,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=170, PETRI_TRANSITIONS=150} [2025-03-17 11:18:50,670 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 36 predicate places. [2025-03-17 11:18:50,670 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 150 transitions, 518 flow [2025-03-17 11:18:50,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 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-17 11:18:50,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:50,670 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:50,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 11:18:50,670 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:50,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:50,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1389132892, now seen corresponding path program 1 times [2025-03-17 11:18:50,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:50,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215612064] [2025-03-17 11:18:50,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:50,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:50,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 11:18:50,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 11:18:50,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:50,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:50,812 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-17 11:18:50,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:50,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215612064] [2025-03-17 11:18:50,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215612064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:50,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:50,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:18:50,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936862795] [2025-03-17 11:18:50,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:50,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:18:50,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:50,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:18:50,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:18:50,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2025-03-17 11:18:50,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 150 transitions, 518 flow. Second operand has 12 states, 12 states have (on average 105.0) internal successors, (1260), 12 states have internal predecessors, (1260), 0 states have call successors, (0), 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-17 11:18:50,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:50,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2025-03-17 11:18:50,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:51,839 INFO L124 PetriNetUnfolderBase]: 1190/7524 cut-off events. [2025-03-17 11:18:51,839 INFO L125 PetriNetUnfolderBase]: For 4150/4378 co-relation queries the response was YES. [2025-03-17 11:18:51,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14306 conditions, 7524 events. 1190/7524 cut-off events. For 4150/4378 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 80828 event pairs, 159 based on Foata normal form. 48/7004 useless extension candidates. Maximal degree in co-relation 4960. Up to 557 conditions per place. [2025-03-17 11:18:51,882 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 90 selfloop transitions, 16 changer transitions 8/227 dead transitions. [2025-03-17 11:18:51,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 227 transitions, 974 flow [2025-03-17 11:18:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:18:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-17 11:18:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1763 transitions. [2025-03-17 11:18:51,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2025-03-17 11:18:51,884 INFO L175 Difference]: Start difference. First operand has 170 places, 150 transitions, 518 flow. Second operand 16 states and 1763 transitions. [2025-03-17 11:18:51,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 227 transitions, 974 flow [2025-03-17 11:18:51,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 227 transitions, 954 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 11:18:51,894 INFO L231 Difference]: Finished difference. Result has 176 places, 148 transitions, 518 flow [2025-03-17 11:18:51,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=518, PETRI_PLACES=176, PETRI_TRANSITIONS=148} [2025-03-17 11:18:51,894 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 42 predicate places. [2025-03-17 11:18:51,894 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 148 transitions, 518 flow [2025-03-17 11:18:51,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 105.0) internal successors, (1260), 12 states have internal predecessors, (1260), 0 states have call successors, (0), 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-17 11:18:51,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:51,895 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:18:51,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 11:18:51,895 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:51,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash 340760609, now seen corresponding path program 1 times [2025-03-17 11:18:51,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:51,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936510981] [2025-03-17 11:18:51,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:51,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:51,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 11:18:51,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 11:18:51,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:51,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:51,926 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-17 11:18:51,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:51,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936510981] [2025-03-17 11:18:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936510981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:51,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:18:51,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764498201] [2025-03-17 11:18:51,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:51,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:18:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:51,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:18:51,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:18:51,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-03-17 11:18:51,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 148 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-17 11:18:51,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:51,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-03-17 11:18:51,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:52,635 INFO L124 PetriNetUnfolderBase]: 1353/8854 cut-off events. [2025-03-17 11:18:52,635 INFO L125 PetriNetUnfolderBase]: For 5201/5285 co-relation queries the response was YES. [2025-03-17 11:18:52,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16720 conditions, 8854 events. 1353/8854 cut-off events. For 5201/5285 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 105926 event pairs, 605 based on Foata normal form. 0/8294 useless extension candidates. Maximal degree in co-relation 15933. Up to 1591 conditions per place. [2025-03-17 11:18:52,675 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 30 selfloop transitions, 9 changer transitions 1/161 dead transitions. [2025-03-17 11:18:52,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 161 transitions, 652 flow [2025-03-17 11:18:52,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:18:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:18:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2025-03-17 11:18:52,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.917312661498708 [2025-03-17 11:18:52,676 INFO L175 Difference]: Start difference. First operand has 176 places, 148 transitions, 518 flow. Second operand 3 states and 355 transitions. [2025-03-17 11:18:52,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 161 transitions, 652 flow [2025-03-17 11:18:52,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 161 transitions, 584 flow, removed 6 selfloop flow, removed 21 redundant places. [2025-03-17 11:18:52,706 INFO L231 Difference]: Finished difference. Result has 159 places, 152 transitions, 526 flow [2025-03-17 11:18:52,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=159, PETRI_TRANSITIONS=152} [2025-03-17 11:18:52,707 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 25 predicate places. [2025-03-17 11:18:52,707 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 152 transitions, 526 flow [2025-03-17 11:18:52,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-17 11:18:52,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:52,707 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:18:52,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 11:18:52,707 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:52,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:52,708 INFO L85 PathProgramCache]: Analyzing trace with hash 353683147, now seen corresponding path program 1 times [2025-03-17 11:18:52,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:52,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691668912] [2025-03-17 11:18:52,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:52,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:52,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 11:18:52,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 11:18:52,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:52,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:52,767 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-17 11:18:52,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:52,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691668912] [2025-03-17 11:18:52,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691668912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:52,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:52,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:52,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066277232] [2025-03-17 11:18:52,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:52,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:18:52,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:52,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:18:52,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:18:52,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-03-17 11:18:52,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 152 transitions, 526 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 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-17 11:18:52,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:52,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-03-17 11:18:52,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:53,212 INFO L124 PetriNetUnfolderBase]: 806/5317 cut-off events. [2025-03-17 11:18:53,212 INFO L125 PetriNetUnfolderBase]: For 3505/3689 co-relation queries the response was YES. [2025-03-17 11:18:53,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9815 conditions, 5317 events. 806/5317 cut-off events. For 3505/3689 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 53133 event pairs, 221 based on Foata normal form. 80/5250 useless extension candidates. Maximal degree in co-relation 9151. Up to 610 conditions per place. [2025-03-17 11:18:53,236 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 5 changer transitions 8/185 dead transitions. [2025-03-17 11:18:53,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 185 transitions, 752 flow [2025-03-17 11:18:53,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:18:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:18:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2025-03-17 11:18:53,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9116279069767442 [2025-03-17 11:18:53,238 INFO L175 Difference]: Start difference. First operand has 159 places, 152 transitions, 526 flow. Second operand 5 states and 588 transitions. [2025-03-17 11:18:53,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 185 transitions, 752 flow [2025-03-17 11:18:53,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 185 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:18:53,245 INFO L231 Difference]: Finished difference. Result has 162 places, 153 transitions, 528 flow [2025-03-17 11:18:53,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=528, PETRI_PLACES=162, PETRI_TRANSITIONS=153} [2025-03-17 11:18:53,245 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 28 predicate places. [2025-03-17 11:18:53,245 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 153 transitions, 528 flow [2025-03-17 11:18:53,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 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-17 11:18:53,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:53,246 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:18:53,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 11:18:53,246 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:18:53,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:53,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1058382866, now seen corresponding path program 1 times [2025-03-17 11:18:53,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:53,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712201642] [2025-03-17 11:18:53,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:53,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:53,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 11:18:53,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 11:18:53,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:53,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:18:54,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712201642] [2025-03-17 11:18:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712201642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:18:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834720225] [2025-03-17 11:18:54,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:54,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:18:54,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:18:54,039 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) [2025-03-17 11:18:54,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:18:54,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 11:18:54,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 11:18:54,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:54,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:54,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 11:18:54,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:18:54,525 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 15 treesize of output 1 [2025-03-17 11:18:54,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:18:54,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 11:18:54,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 11:18:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:18:54,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:18:55,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-03-17 11:18:55,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2025-03-17 11:18:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:18:55,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834720225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:18:55,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:18:55,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 18] total 55 [2025-03-17 11:18:55,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472329906] [2025-03-17 11:18:55,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:18:55,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-17 11:18:55,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:55,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-17 11:18:55,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2711, Unknown=0, NotChecked=0, Total=2970 [2025-03-17 11:18:59,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 129 [2025-03-17 11:18:59,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 153 transitions, 528 flow. Second operand has 55 states, 55 states have (on average 96.69090909090909) internal successors, (5318), 55 states have internal predecessors, (5318), 0 states have call successors, (0), 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-17 11:18:59,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:59,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 129 [2025-03-17 11:18:59,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:01,500 INFO L124 PetriNetUnfolderBase]: 1748/7093 cut-off events. [2025-03-17 11:19:01,501 INFO L125 PetriNetUnfolderBase]: For 3922/4118 co-relation queries the response was YES. [2025-03-17 11:19:01,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14366 conditions, 7093 events. 1748/7093 cut-off events. For 3922/4118 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 69342 event pairs, 88 based on Foata normal form. 24/6912 useless extension candidates. Maximal degree in co-relation 6018. Up to 893 conditions per place. [2025-03-17 11:19:01,535 INFO L140 encePairwiseOnDemand]: 111/129 looper letters, 135 selfloop transitions, 28 changer transitions 8/278 dead transitions. [2025-03-17 11:19:01,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 278 transitions, 1239 flow [2025-03-17 11:19:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 11:19:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-17 11:19:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2521 transitions. [2025-03-17 11:19:01,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7817054263565891 [2025-03-17 11:19:01,538 INFO L175 Difference]: Start difference. First operand has 162 places, 153 transitions, 528 flow. Second operand 25 states and 2521 transitions. [2025-03-17 11:19:01,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 278 transitions, 1239 flow [2025-03-17 11:19:01,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 278 transitions, 1229 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-17 11:19:01,547 INFO L231 Difference]: Finished difference. Result has 191 places, 161 transitions, 626 flow [2025-03-17 11:19:01,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=626, PETRI_PLACES=191, PETRI_TRANSITIONS=161} [2025-03-17 11:19:01,547 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 57 predicate places. [2025-03-17 11:19:01,547 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 161 transitions, 626 flow [2025-03-17 11:19:01,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 96.69090909090909) internal successors, (5318), 55 states have internal predecessors, (5318), 0 states have call successors, (0), 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-17 11:19:01,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:01,549 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:19:01,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:19:01,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:19:01,750 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:19:01,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:01,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1231894684, now seen corresponding path program 2 times [2025-03-17 11:19:01,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:01,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224273991] [2025-03-17 11:19:01,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:19:01,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:01,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-03-17 11:19:01,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 11:19:01,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:19:01,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:19:02,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:02,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224273991] [2025-03-17 11:19:02,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224273991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:19:02,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253221827] [2025-03-17 11:19:02,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:19:02,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:19:02,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:19:02,725 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) [2025-03-17 11:19:02,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:19:02,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-03-17 11:19:03,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 11:19:03,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:19:03,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:03,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 11:19:03,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:19:03,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 11:19:03,826 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-03-17 11:19:03,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2025-03-17 11:19:04,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 11:19:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:19:04,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:19:04,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-03-17 11:19:04,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2025-03-17 11:19:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:19:04,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253221827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:19:04,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:19:04,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 21] total 57 [2025-03-17 11:19:04,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812433930] [2025-03-17 11:19:04,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:19:04,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-17 11:19:04,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:04,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-17 11:19:04,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=2873, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 11:19:07,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:19:08,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:19:10,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:19:12,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:19:14,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:19:15,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 129 [2025-03-17 11:19:15,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 161 transitions, 626 flow. Second operand has 57 states, 57 states have (on average 90.26315789473684) internal successors, (5145), 57 states have internal predecessors, (5145), 0 states have call successors, (0), 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-17 11:19:15,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:15,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 129 [2025-03-17 11:19:15,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:17,836 INFO L124 PetriNetUnfolderBase]: 1532/5648 cut-off events. [2025-03-17 11:19:17,837 INFO L125 PetriNetUnfolderBase]: For 3778/3886 co-relation queries the response was YES. [2025-03-17 11:19:17,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12516 conditions, 5648 events. 1532/5648 cut-off events. For 3778/3886 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 50363 event pairs, 4 based on Foata normal form. 36/5605 useless extension candidates. Maximal degree in co-relation 7174. Up to 796 conditions per place. [2025-03-17 11:19:17,865 INFO L140 encePairwiseOnDemand]: 107/129 looper letters, 189 selfloop transitions, 41 changer transitions 16/347 dead transitions. [2025-03-17 11:19:17,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 347 transitions, 1691 flow [2025-03-17 11:19:17,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-17 11:19:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-17 11:19:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3467 transitions. [2025-03-17 11:19:17,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7263775403310287 [2025-03-17 11:19:17,868 INFO L175 Difference]: Start difference. First operand has 191 places, 161 transitions, 626 flow. Second operand 37 states and 3467 transitions. [2025-03-17 11:19:17,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 347 transitions, 1691 flow [2025-03-17 11:19:17,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 347 transitions, 1649 flow, removed 1 selfloop flow, removed 17 redundant places. [2025-03-17 11:19:17,878 INFO L231 Difference]: Finished difference. Result has 214 places, 168 transitions, 720 flow [2025-03-17 11:19:17,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=720, PETRI_PLACES=214, PETRI_TRANSITIONS=168} [2025-03-17 11:19:17,879 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 80 predicate places. [2025-03-17 11:19:17,879 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 168 transitions, 720 flow [2025-03-17 11:19:17,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 90.26315789473684) internal successors, (5145), 57 states have internal predecessors, (5145), 0 states have call successors, (0), 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-17 11:19:17,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:17,881 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:19:17,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:19:18,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-17 11:19:18,081 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:19:18,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1100188823, now seen corresponding path program 1 times [2025-03-17 11:19:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:18,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620362835] [2025-03-17 11:19:18,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:19:18,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:18,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 11:19:18,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 11:19:18,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:18,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:19:18,105 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:19:18,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 11:19:18,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 11:19:18,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:19:18,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:19:18,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:19:18,145 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:19:18,145 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-03-17 11:19:18,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-17 11:19:18,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-17 11:19:18,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-17 11:19:18,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-03-17 11:19:18,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-17 11:19:18,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-17 11:19:18,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-17 11:19:18,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-17 11:19:18,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-17 11:19:18,146 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:19:18,253 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2025-03-17 11:19:18,254 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:19:18,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:19:18 BasicIcfg [2025-03-17 11:19:18,260 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:19:18,260 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:19:18,260 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:19:18,260 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:19:18,261 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:18:22" (3/4) ... [2025-03-17 11:19:18,262 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 11:19:18,348 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-17 11:19:18,383 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:19:18,383 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:19:18,383 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:19:18,384 INFO L158 Benchmark]: Toolchain (without parser) took 56311.85ms. Allocated memory was 142.6MB in the beginning and 5.6GB in the end (delta: 5.5GB). Free memory was 103.4MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-03-17 11:19:18,384 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:19:18,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.01ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 84.0MB in the end (delta: 19.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 11:19:18,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.32ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 83.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:19:18,384 INFO L158 Benchmark]: Boogie Preprocessor took 19.04ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 82.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:19:18,385 INFO L158 Benchmark]: IcfgBuilder took 370.71ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 66.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:19:18,386 INFO L158 Benchmark]: TraceAbstraction took 55393.32ms. Allocated memory was 142.6MB in the beginning and 5.6GB in the end (delta: 5.5GB). Free memory was 66.2MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2025-03-17 11:19:18,386 INFO L158 Benchmark]: Witness Printer took 123.30ms. Allocated memory is still 5.6GB. Free memory was 3.8GB in the beginning and 3.7GB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-17 11:19:18,387 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 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.01ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 84.0MB in the end (delta: 19.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.32ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 83.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.04ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 82.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 370.71ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 66.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 55393.32ms. Allocated memory was 142.6MB in the beginning and 5.6GB in the end (delta: 5.5GB). Free memory was 66.2MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 123.30ms. Allocated memory is still 5.6GB. Free memory was 3.8GB in the beginning and 3.7GB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 685]: Data race detected Data race detected The following path leads to a data race: [L681] 0 int data = 0; VAL [data=0] [L682] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}] [L690] 0 int threads_total = 4; VAL [data=0, data_mutex={1:0}, threads_total=4] [L691] 0 pthread_t tids[4]; VAL [data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L692] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L685] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L685] 3 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L685] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L687] 3 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L692] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L695] 0 int i = 0; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L687] 1 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L696] FCALL, JOIN 1 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L695] 0 i += 2 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L696] FCALL, JOIN 3 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L695] 0 i += 2 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L695] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L698] 0 return data; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L685] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [698] and C: data = __VERIFIER_nondet_int() [685] - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 92 locations, 93 edges, 6 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: 1.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 8 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=3, InterpolantAutomatonStates: 24, 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.6s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1/1 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 109 locations, 111 edges, 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: 1.7s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 587 IncrementalHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 35 mSDtfsCounter, 587 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=6, InterpolantAutomatonStates: 37, 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.5s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 126 locations, 129 edges, 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: 4.3s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 787 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 561 mSDsluCounter, 199 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1196 IncrementalHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 96 mSDtfsCounter, 1196 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=7, InterpolantAutomatonStates: 56, 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.5s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 1292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 39/39 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 - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 143 locations, 147 edges, 9 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: 47.7s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 40.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 4543 SdHoareTripleChecker+Valid, 17.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4181 mSDsluCounter, 6255 SdHoareTripleChecker+Invalid, 15.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6145 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34189 IncrementalHoareTripleChecker+Invalid, 34263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 110 mSDtfsCounter, 34189 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 786 GetRequests, 549 SyntacticMatches, 3 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4133 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=720occurred in iteration=17, InterpolantAutomatonStates: 151, 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.4s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1730 NumberOfCodeBlocks, 1730 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1857 ConstructedInterpolants, 36 QuantifiedInterpolants, 11965 SizeOfPredicates, 39 NumberOfNonLiveVariables, 806 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 10/54 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-17 11:19:18,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)