./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 798a7b37 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-?-798a7b3-m [2025-03-04 06:59:32,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:59:32,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:59:32,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:59:32,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:59:32,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:59:32,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:59:32,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:59:32,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:59:32,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:59:32,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:59:32,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:59:32,138 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:59:32,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:59:32,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:59:32,139 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:59:32,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:59:32,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:59:32,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:59:32,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:59:32,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:59:32,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:59:32,140 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:59:32,140 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:59:32,140 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:59:32,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:59:32,140 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:59:32,140 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:59:32,140 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:59:32,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:59:32,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:59:32,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:59:32,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:59:32,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:59:32,141 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:59:32,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:59:32,141 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:59:32,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:59:32,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:59:32,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:59:32,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:59:32,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:59:32,142 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-04 06:59:32,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:59:32,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:59:32,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:59:32,360 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:59:32,360 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:59:32,361 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-04 06:59:33,496 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23bf063bb/05208f8c8bfc4adbb3636111a349579d/FLAGb71a5dee3 [2025-03-04 06:59:33,813 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:59:33,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.i [2025-03-04 06:59:33,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23bf063bb/05208f8c8bfc4adbb3636111a349579d/FLAGb71a5dee3 [2025-03-04 06:59:33,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23bf063bb/05208f8c8bfc4adbb3636111a349579d [2025-03-04 06:59:33,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:59:33,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:59:33,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:59:33,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:59:33,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:59:33,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:59:33" (1/1) ... [2025-03-04 06:59:33,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8eb620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:33, skipping insertion in model container [2025-03-04 06:59:33,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:59:33" (1/1) ... [2025-03-04 06:59:33,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:59:34,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:59:34,089 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:59:34,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:59:34,168 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:59:34,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:34 WrapperNode [2025-03-04 06:59:34,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:59:34,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:59:34,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:59:34,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:59:34,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:34" (1/1) ... [2025-03-04 06:59:34,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:34" (1/1) ... [2025-03-04 06:59:34,199 INFO L138 Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2025-03-04 06:59:34,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:59:34,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:59:34,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:59:34,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:59:34,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:34" (1/1) ... [2025-03-04 06:59:34,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:34" (1/1) ... [2025-03-04 06:59:34,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:34" (1/1) ... [2025-03-04 06:59:34,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:34" (1/1) ... [2025-03-04 06:59:34,217 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:34" (1/1) ... [2025-03-04 06:59:34,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:34" (1/1) ... [2025-03-04 06:59:34,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:34" (1/1) ... [2025-03-04 06:59:34,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:34" (1/1) ... [2025-03-04 06:59:34,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:59:34,227 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:59:34,228 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:59:34,228 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:59:34,228 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:34" (1/1) ... [2025-03-04 06:59:34,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:59:34,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:59:34,256 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-04 06:59:34,259 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-04 06:59:34,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:59:34,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:59:34,276 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:59:34,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:59:34,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:59:34,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:59:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:59:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-04 06:59:34,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-04 06:59:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:59:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:59:34,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:59:34,278 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:59:34,379 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:59:34,381 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:59:34,506 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~#tids~0#1.base, main_~#tids~0#1.offset; [2025-03-04 06:59:34,506 INFO L1325 $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-04 06:59:34,535 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:59:34,535 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:59:34,546 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:59:34,547 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:59:34,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:59:34 BoogieIcfgContainer [2025-03-04 06:59:34,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:59:34,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:59:34,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:59:34,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:59:34,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:59:33" (1/3) ... [2025-03-04 06:59:34,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abd8f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:59:34, skipping insertion in model container [2025-03-04 06:59:34,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:59:34" (2/3) ... [2025-03-04 06:59:34,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abd8f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:59:34, skipping insertion in model container [2025-03-04 06:59:34,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:59:34" (3/3) ... [2025-03-04 06:59:34,555 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-2.i [2025-03-04 06:59:34,565 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:59:34,567 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-04 06:59:34,567 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:59:34,617 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:59:34,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 75 transitions, 157 flow [2025-03-04 06:59:34,679 INFO L124 PetriNetUnfolderBase]: 1/108 cut-off events. [2025-03-04 06:59:34,681 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:59:34,684 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-04 06:59:34,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 75 transitions, 157 flow [2025-03-04 06:59:34,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 75 transitions, 157 flow [2025-03-04 06:59:34,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:59:34,700 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;@6dc57cfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:59:34,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 06:59:34,707 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:59:34,707 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-04 06:59:34,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:59:34,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:34,708 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-04 06:59:34,708 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-04 06:59:34,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:34,715 INFO L85 PathProgramCache]: Analyzing trace with hash -849884664, now seen corresponding path program 1 times [2025-03-04 06:59:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:34,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041954575] [2025-03-04 06:59:34,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:34,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:34,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 06:59:34,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 06:59:34,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:34,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:34,957 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-04 06:59:34,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:34,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041954575] [2025-03-04 06:59:34,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041954575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:34,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:34,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:59:34,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375150593] [2025-03-04 06:59:34,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:34,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:59:34,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:34,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:59:34,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:59:35,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 75 [2025-03-04 06:59:35,044 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-04 06:59:35,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:35,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 75 [2025-03-04 06:59:35,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:35,110 INFO L124 PetriNetUnfolderBase]: 8/185 cut-off events. [2025-03-04 06:59:35,110 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:59:35,111 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 575 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-04 06:59:35,114 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 10 selfloop transitions, 4 changer transitions 1/79 dead transitions. [2025-03-04 06:59:35,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 195 flow [2025-03-04 06:59:35,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:59:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 06:59:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2025-03-04 06:59:35,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2025-03-04 06:59:35,129 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 157 flow. Second operand 4 states and 272 transitions. [2025-03-04 06:59:35,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 195 flow [2025-03-04 06:59:35,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 195 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:35,138 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 169 flow [2025-03-04 06:59:35,141 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-04 06:59:35,144 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-03-04 06:59:35,146 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 169 flow [2025-03-04 06:59:35,146 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-04 06:59:35,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:35,146 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-04 06:59:35,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:59:35,147 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-04 06:59:35,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:35,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2025401462, now seen corresponding path program 1 times [2025-03-04 06:59:35,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:35,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099026697] [2025-03-04 06:59:35,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:35,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:35,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:59:35,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:59:35,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:35,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:35,492 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-04 06:59:35,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:35,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099026697] [2025-03-04 06:59:35,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099026697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:35,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:35,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:35,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740312619] [2025-03-04 06:59:35,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:35,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:35,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:35,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:35,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:35,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 75 [2025-03-04 06:59:35,603 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-04 06:59:35,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:35,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 75 [2025-03-04 06:59:35,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:35,693 INFO L124 PetriNetUnfolderBase]: 30/233 cut-off events. [2025-03-04 06:59:35,695 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 06:59:35,696 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 945 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-04 06:59:35,697 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 25 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2025-03-04 06:59:35,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 243 flow [2025-03-04 06:59:35,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 343 transitions. [2025-03-04 06:59:35,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7622222222222222 [2025-03-04 06:59:35,701 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 169 flow. Second operand 6 states and 343 transitions. [2025-03-04 06:59:35,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 243 flow [2025-03-04 06:59:35,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 82 transitions, 235 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 06:59:35,703 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 169 flow [2025-03-04 06:59:35,703 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-04 06:59:35,703 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-03-04 06:59:35,704 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 169 flow [2025-03-04 06:59:35,704 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-04 06:59:35,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:35,704 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-04 06:59:35,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:59:35,704 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-04 06:59:35,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1492450601, now seen corresponding path program 1 times [2025-03-04 06:59:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:35,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981440630] [2025-03-04 06:59:35,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:35,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:35,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:59:35,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:59:35,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:35,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:35,756 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-04 06:59:35,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:35,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981440630] [2025-03-04 06:59:35,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981440630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:35,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:35,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:35,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264279244] [2025-03-04 06:59:35,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:35,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:35,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:35,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:35,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:35,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 75 [2025-03-04 06:59:35,769 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-04 06:59:35,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:35,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 75 [2025-03-04 06:59:35,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:35,790 INFO L124 PetriNetUnfolderBase]: 6/141 cut-off events. [2025-03-04 06:59:35,791 INFO L125 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2025-03-04 06:59:35,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 141 events. 6/141 cut-off events. For 4/10 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-04 06:59:35,792 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 9 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-03-04 06:59:35,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 77 transitions, 201 flow [2025-03-04 06:59:35,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-03-04 06:59:35,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288888888888889 [2025-03-04 06:59:35,794 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 169 flow. Second operand 3 states and 209 transitions. [2025-03-04 06:59:35,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 77 transitions, 201 flow [2025-03-04 06:59:35,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 77 transitions, 191 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:59:35,796 INFO L231 Difference]: Finished difference. Result has 81 places, 77 transitions, 189 flow [2025-03-04 06:59:35,796 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-04 06:59:35,797 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-03-04 06:59:35,797 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 189 flow [2025-03-04 06:59:35,797 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-04 06:59:35,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:35,797 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-04 06:59:35,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:59:35,797 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-04 06:59:35,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:35,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1436862769, now seen corresponding path program 1 times [2025-03-04 06:59:35,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:35,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156233594] [2025-03-04 06:59:35,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:35,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:35,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 06:59:35,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 06:59:35,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:35,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:35,858 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-04 06:59:35,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:35,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156233594] [2025-03-04 06:59:35,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156233594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:35,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:35,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:59:35,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121217099] [2025-03-04 06:59:35,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:35,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:59:35,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:35,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:59:35,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:59:35,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 75 [2025-03-04 06:59:35,889 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-04 06:59:35,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:35,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 75 [2025-03-04 06:59:35,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:35,908 INFO L124 PetriNetUnfolderBase]: 2/106 cut-off events. [2025-03-04 06:59:35,908 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:59:35,909 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-04 06:59:35,909 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 9 selfloop transitions, 3 changer transitions 7/75 dead transitions. [2025-03-04 06:59:35,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 75 transitions, 199 flow [2025-03-04 06:59:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:59:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 06:59:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2025-03-04 06:59:35,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9 [2025-03-04 06:59:35,910 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 189 flow. Second operand 4 states and 270 transitions. [2025-03-04 06:59:35,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 75 transitions, 199 flow [2025-03-04 06:59:35,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 187 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 06:59:35,912 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 153 flow [2025-03-04 06:59:35,912 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-04 06:59:35,912 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-03-04 06:59:35,912 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 153 flow [2025-03-04 06:59:35,913 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-04 06:59:35,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:35,913 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-04 06:59:35,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:59:35,913 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-04 06:59:35,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:35,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1607733821, now seen corresponding path program 1 times [2025-03-04 06:59:35,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:35,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203509232] [2025-03-04 06:59:35,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:35,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:35,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:59:35,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:59:35,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:35,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:35,997 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-04 06:59:35,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:35,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203509232] [2025-03-04 06:59:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203509232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:35,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:35,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:59:35,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2715919] [2025-03-04 06:59:35,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:35,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:35,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:35,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:35,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:36,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 75 [2025-03-04 06:59:36,064 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-04 06:59:36,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:36,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 75 [2025-03-04 06:59:36,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:36,113 INFO L124 PetriNetUnfolderBase]: 6/87 cut-off events. [2025-03-04 06:59:36,113 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:59:36,114 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 140 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-04 06:59:36,115 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 10 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-03-04 06:59:36,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 146 flow [2025-03-04 06:59:36,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:59:36,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 06:59:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 450 transitions. [2025-03-04 06:59:36,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-03-04 06:59:36,117 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 153 flow. Second operand 7 states and 450 transitions. [2025-03-04 06:59:36,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 146 flow [2025-03-04 06:59:36,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:36,120 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 111 flow [2025-03-04 06:59:36,120 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-04 06:59:36,120 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -18 predicate places. [2025-03-04 06:59:36,120 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 111 flow [2025-03-04 06:59:36,121 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-04 06:59:36,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:36,121 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-04 06:59:36,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:59:36,121 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-04 06:59:36,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:36,121 INFO L85 PathProgramCache]: Analyzing trace with hash 744727939, now seen corresponding path program 1 times [2025-03-04 06:59:36,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:36,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561507509] [2025-03-04 06:59:36,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:36,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:36,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:59:36,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:59:36,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:36,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:59:36,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:59:36,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:59:36,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:59:36,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:36,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:59:36,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:59:36,166 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:59:36,167 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-04 06:59:36,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-03-04 06:59:36,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-03-04 06:59:36,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-03-04 06:59:36,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-03-04 06:59:36,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-03-04 06:59:36,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:59:36,169 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 06:59:36,170 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:59:36,170 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:59:36,181 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:59:36,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 93 transitions, 202 flow [2025-03-04 06:59:36,200 INFO L124 PetriNetUnfolderBase]: 3/190 cut-off events. [2025-03-04 06:59:36,201 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:59:36,201 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-04 06:59:36,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 93 transitions, 202 flow [2025-03-04 06:59:36,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 93 transitions, 202 flow [2025-03-04 06:59:36,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:59:36,204 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;@6dc57cfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:59:36,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 06:59:36,208 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:59:36,209 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-04 06:59:36,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:59:36,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:36,210 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-04 06:59:36,210 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-04 06:59:36,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:36,210 INFO L85 PathProgramCache]: Analyzing trace with hash 861401576, now seen corresponding path program 1 times [2025-03-04 06:59:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:36,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501401471] [2025-03-04 06:59:36,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:36,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 06:59:36,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 06:59:36,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:36,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:36,269 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-04 06:59:36,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:36,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501401471] [2025-03-04 06:59:36,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501401471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:36,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:36,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:59:36,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699237295] [2025-03-04 06:59:36,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:36,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:59:36,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:36,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:59:36,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:59:36,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-03-04 06:59:36,297 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-04 06:59:36,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:36,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-03-04 06:59:36,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:36,373 INFO L124 PetriNetUnfolderBase]: 72/571 cut-off events. [2025-03-04 06:59:36,373 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-04 06:59:36,375 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 3298 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-04 06:59:36,377 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 18 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2025-03-04 06:59:36,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 100 transitions, 260 flow [2025-03-04 06:59:36,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:59:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 06:59:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 335 transitions. [2025-03-04 06:59:36,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9005376344086021 [2025-03-04 06:59:36,378 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 202 flow. Second operand 4 states and 335 transitions. [2025-03-04 06:59:36,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 100 transitions, 260 flow [2025-03-04 06:59:36,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 100 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:36,380 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 218 flow [2025-03-04 06:59:36,380 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-04 06:59:36,380 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 4 predicate places. [2025-03-04 06:59:36,380 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 218 flow [2025-03-04 06:59:36,381 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-04 06:59:36,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:36,381 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-04 06:59:36,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:59:36,381 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-04 06:59:36,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:36,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1692066131, now seen corresponding path program 1 times [2025-03-04 06:59:36,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:36,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894927432] [2025-03-04 06:59:36,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:36,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:36,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:59:36,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:59:36,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:36,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:36,530 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-04 06:59:36,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:36,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894927432] [2025-03-04 06:59:36,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894927432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:36,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:36,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:36,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828144699] [2025-03-04 06:59:36,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:36,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:36,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:36,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:36,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:36,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 93 [2025-03-04 06:59:36,600 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-04 06:59:36,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:36,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 93 [2025-03-04 06:59:36,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:36,726 INFO L124 PetriNetUnfolderBase]: 236/941 cut-off events. [2025-03-04 06:59:36,727 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-04 06:59:36,729 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 6563 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-04 06:59:36,732 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 38 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2025-03-04 06:59:36,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 109 transitions, 334 flow [2025-03-04 06:59:36,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2025-03-04 06:59:36,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7867383512544803 [2025-03-04 06:59:36,735 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 218 flow. Second operand 6 states and 439 transitions. [2025-03-04 06:59:36,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 109 transitions, 334 flow [2025-03-04 06:59:36,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 109 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:36,739 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 220 flow [2025-03-04 06:59:36,740 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-04 06:59:36,740 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 6 predicate places. [2025-03-04 06:59:36,740 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 220 flow [2025-03-04 06:59:36,740 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-04 06:59:36,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:36,741 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-04 06:59:36,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:59:36,741 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-04 06:59:36,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:36,741 INFO L85 PathProgramCache]: Analyzing trace with hash 528694742, now seen corresponding path program 1 times [2025-03-04 06:59:36,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:36,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875320325] [2025-03-04 06:59:36,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:36,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:36,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:59:36,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:59:36,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:36,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:36,771 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-04 06:59:36,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:36,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875320325] [2025-03-04 06:59:36,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875320325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:36,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:36,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:36,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742829806] [2025-03-04 06:59:36,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:36,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:36,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:36,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:36,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:36,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-03-04 06:59:36,784 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-04 06:59:36,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:36,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-03-04 06:59:36,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:36,850 INFO L124 PetriNetUnfolderBase]: 116/707 cut-off events. [2025-03-04 06:59:36,850 INFO L125 PetriNetUnfolderBase]: For 120/165 co-relation queries the response was YES. [2025-03-04 06:59:36,852 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 4615 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-04 06:59:36,854 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 18 selfloop transitions, 5 changer transitions 0/101 dead transitions. [2025-03-04 06:59:36,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 290 flow [2025-03-04 06:59:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2025-03-04 06:59:36,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2025-03-04 06:59:36,855 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 220 flow. Second operand 3 states and 258 transitions. [2025-03-04 06:59:36,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 290 flow [2025-03-04 06:59:36,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 101 transitions, 280 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:59:36,857 INFO L231 Difference]: Finished difference. Result has 101 places, 97 transitions, 248 flow [2025-03-04 06:59:36,857 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-04 06:59:36,857 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 5 predicate places. [2025-03-04 06:59:36,858 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 97 transitions, 248 flow [2025-03-04 06:59:36,858 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-04 06:59:36,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:36,858 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-04 06:59:36,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:59:36,858 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-04 06:59:36,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:36,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1262183778, now seen corresponding path program 1 times [2025-03-04 06:59:36,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:36,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864644780] [2025-03-04 06:59:36,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:36,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:36,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 06:59:36,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 06:59:36,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:36,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:36,898 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-04 06:59:36,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:36,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864644780] [2025-03-04 06:59:36,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864644780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:36,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:36,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:59:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842862431] [2025-03-04 06:59:36,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:36,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:59:36,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:36,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:59:36,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:59:36,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-03-04 06:59:36,928 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-04 06:59:36,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:36,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-03-04 06:59:36,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:37,012 INFO L124 PetriNetUnfolderBase]: 63/580 cut-off events. [2025-03-04 06:59:37,013 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-04 06:59:37,014 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 3209 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-04 06:59:37,015 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 19 selfloop transitions, 4 changer transitions 3/108 dead transitions. [2025-03-04 06:59:37,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 108 transitions, 328 flow [2025-03-04 06:59:37,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:59:37,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 06:59:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 339 transitions. [2025-03-04 06:59:37,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9112903225806451 [2025-03-04 06:59:37,017 INFO L175 Difference]: Start difference. First operand has 101 places, 97 transitions, 248 flow. Second operand 4 states and 339 transitions. [2025-03-04 06:59:37,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 108 transitions, 328 flow [2025-03-04 06:59:37,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 108 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:37,019 INFO L231 Difference]: Finished difference. Result has 103 places, 98 transitions, 254 flow [2025-03-04 06:59:37,019 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-04 06:59:37,020 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 7 predicate places. [2025-03-04 06:59:37,020 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 98 transitions, 254 flow [2025-03-04 06:59:37,020 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-04 06:59:37,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:37,020 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-04 06:59:37,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:59:37,020 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-04 06:59:37,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash 394892909, now seen corresponding path program 1 times [2025-03-04 06:59:37,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:37,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133395386] [2025-03-04 06:59:37,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:37,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:37,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:59:37,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:59:37,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:37,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:37,106 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-04 06:59:37,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:37,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133395386] [2025-03-04 06:59:37,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133395386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:37,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:37,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:59:37,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782596200] [2025-03-04 06:59:37,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:37,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:37,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:37,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:37,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:37,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 93 [2025-03-04 06:59:37,186 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-04 06:59:37,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:37,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 93 [2025-03-04 06:59:37,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:37,354 INFO L124 PetriNetUnfolderBase]: 111/852 cut-off events. [2025-03-04 06:59:37,355 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-03-04 06:59:37,357 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 5389 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-04 06:59:37,360 INFO L140 encePairwiseOnDemand]: 86/93 looper letters, 24 selfloop transitions, 7 changer transitions 3/114 dead transitions. [2025-03-04 06:59:37,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 114 transitions, 354 flow [2025-03-04 06:59:37,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:59:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 06:59:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 567 transitions. [2025-03-04 06:59:37,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8709677419354839 [2025-03-04 06:59:37,361 INFO L175 Difference]: Start difference. First operand has 103 places, 98 transitions, 254 flow. Second operand 7 states and 567 transitions. [2025-03-04 06:59:37,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 114 transitions, 354 flow [2025-03-04 06:59:37,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 114 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:37,364 INFO L231 Difference]: Finished difference. Result has 110 places, 100 transitions, 278 flow [2025-03-04 06:59:37,364 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-04 06:59:37,364 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 14 predicate places. [2025-03-04 06:59:37,364 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 100 transitions, 278 flow [2025-03-04 06:59:37,365 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-04 06:59:37,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:37,365 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-04 06:59:37,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:59:37,365 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-04 06:59:37,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:37,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1898818033, now seen corresponding path program 1 times [2025-03-04 06:59:37,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:37,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17819737] [2025-03-04 06:59:37,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:37,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:37,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:59:37,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:59:37,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:37,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:37,412 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-04 06:59:37,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:37,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17819737] [2025-03-04 06:59:37,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17819737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:37,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:37,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:37,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826693146] [2025-03-04 06:59:37,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:37,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:37,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:37,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:37,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:37,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-03-04 06:59:37,431 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-04 06:59:37,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:37,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-03-04 06:59:37,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:37,507 INFO L124 PetriNetUnfolderBase]: 58/570 cut-off events. [2025-03-04 06:59:37,507 INFO L125 PetriNetUnfolderBase]: For 156/208 co-relation queries the response was YES. [2025-03-04 06:59:37,510 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 3280 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-04 06:59:37,512 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 18 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2025-03-04 06:59:37,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 107 transitions, 347 flow [2025-03-04 06:59:37,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:37,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2025-03-04 06:59:37,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.921146953405018 [2025-03-04 06:59:37,514 INFO L175 Difference]: Start difference. First operand has 110 places, 100 transitions, 278 flow. Second operand 3 states and 257 transitions. [2025-03-04 06:59:37,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 107 transitions, 347 flow [2025-03-04 06:59:37,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 337 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 06:59:37,517 INFO L231 Difference]: Finished difference. Result has 111 places, 104 transitions, 314 flow [2025-03-04 06:59:37,517 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-04 06:59:37,518 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 15 predicate places. [2025-03-04 06:59:37,518 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 314 flow [2025-03-04 06:59:37,519 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-04 06:59:37,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:37,519 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-04 06:59:37,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:59:37,519 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-04 06:59:37,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:37,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1366992420, now seen corresponding path program 1 times [2025-03-04 06:59:37,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:37,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448125010] [2025-03-04 06:59:37,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:37,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:37,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:59:37,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:59:37,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:37,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:37,662 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-04 06:59:37,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:37,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448125010] [2025-03-04 06:59:37,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448125010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:37,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:37,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:59:37,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40854474] [2025-03-04 06:59:37,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:37,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:59:37,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:37,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:59:37,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:59:37,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 93 [2025-03-04 06:59:37,729 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-04 06:59:37,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:37,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 93 [2025-03-04 06:59:37,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:37,846 INFO L124 PetriNetUnfolderBase]: 71/470 cut-off events. [2025-03-04 06:59:37,846 INFO L125 PetriNetUnfolderBase]: For 93/97 co-relation queries the response was YES. [2025-03-04 06:59:37,847 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 2513 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-04 06:59:37,849 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 25 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2025-03-04 06:59:37,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 328 flow [2025-03-04 06:59:37,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:59:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 06:59:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 794 transitions. [2025-03-04 06:59:37,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.853763440860215 [2025-03-04 06:59:37,851 INFO L175 Difference]: Start difference. First operand has 111 places, 104 transitions, 314 flow. Second operand 10 states and 794 transitions. [2025-03-04 06:59:37,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 328 flow [2025-03-04 06:59:37,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 93 transitions, 314 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:59:37,854 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 228 flow [2025-03-04 06:59:37,854 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-04 06:59:37,855 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -5 predicate places. [2025-03-04 06:59:37,855 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 228 flow [2025-03-04 06:59:37,856 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-04 06:59:37,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:37,856 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-04 06:59:37,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:59:37,856 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-04 06:59:37,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:37,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1871679209, now seen corresponding path program 1 times [2025-03-04 06:59:37,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:37,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971599771] [2025-03-04 06:59:37,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:37,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:37,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:59:37,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:59:37,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:37,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:59:37,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:59:37,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:59:37,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:59:37,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:37,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:59:37,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:59:37,911 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:59:37,911 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-04 06:59:37,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-04 06:59:37,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-04 06:59:37,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-04 06:59:37,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-04 06:59:37,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-04 06:59:37,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-04 06:59:37,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:59:37,912 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:59:37,912 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:59:37,912 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:59:37,927 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:59:37,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 111 transitions, 249 flow [2025-03-04 06:59:37,949 INFO L124 PetriNetUnfolderBase]: 8/319 cut-off events. [2025-03-04 06:59:37,949 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 06:59:37,950 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-04 06:59:37,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 111 transitions, 249 flow [2025-03-04 06:59:37,951 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 111 transitions, 249 flow [2025-03-04 06:59:37,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:59:37,953 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;@6dc57cfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:59:37,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 06:59:37,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:59:37,954 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-04 06:59:37,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:59:37,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:37,954 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-04 06:59:37,954 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-04 06:59:37,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash -975420792, now seen corresponding path program 1 times [2025-03-04 06:59:37,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:37,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898247322] [2025-03-04 06:59:37,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:37,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:37,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 06:59:37,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 06:59:37,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:37,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:37,978 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-04 06:59:37,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:37,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898247322] [2025-03-04 06:59:37,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898247322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:37,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:37,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:59:37,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128578540] [2025-03-04 06:59:37,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:37,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:59:37,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:37,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:59:37,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:59:38,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2025-03-04 06:59:38,002 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-04 06:59:38,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:38,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2025-03-04 06:59:38,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:38,161 INFO L124 PetriNetUnfolderBase]: 413/2179 cut-off events. [2025-03-04 06:59:38,161 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2025-03-04 06:59:38,166 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 17461 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-04 06:59:38,173 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 24 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-03-04 06:59:38,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 120 transitions, 323 flow [2025-03-04 06:59:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:59:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 06:59:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2025-03-04 06:59:38,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8941441441441441 [2025-03-04 06:59:38,174 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 249 flow. Second operand 4 states and 397 transitions. [2025-03-04 06:59:38,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 120 transitions, 323 flow [2025-03-04 06:59:38,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 323 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:38,176 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 265 flow [2025-03-04 06:59:38,176 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-04 06:59:38,176 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 4 predicate places. [2025-03-04 06:59:38,177 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 112 transitions, 265 flow [2025-03-04 06:59:38,177 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-04 06:59:38,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:38,177 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-04 06:59:38,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:59:38,177 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-04 06:59:38,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:38,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1199637694, now seen corresponding path program 1 times [2025-03-04 06:59:38,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:38,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027387395] [2025-03-04 06:59:38,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:38,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:38,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:59:38,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:59:38,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:38,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:38,299 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-04 06:59:38,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:38,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027387395] [2025-03-04 06:59:38,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027387395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:38,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:38,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:38,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388712115] [2025-03-04 06:59:38,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:38,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:38,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:38,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:38,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:38,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 111 [2025-03-04 06:59:38,407 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-04 06:59:38,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:38,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 111 [2025-03-04 06:59:38,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:38,747 INFO L124 PetriNetUnfolderBase]: 1292/3939 cut-off events. [2025-03-04 06:59:38,748 INFO L125 PetriNetUnfolderBase]: For 316/316 co-relation queries the response was YES. [2025-03-04 06:59:38,759 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 34550 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-04 06:59:38,775 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 50 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2025-03-04 06:59:38,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 135 transitions, 421 flow [2025-03-04 06:59:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2025-03-04 06:59:38,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8033033033033034 [2025-03-04 06:59:38,779 INFO L175 Difference]: Start difference. First operand has 119 places, 112 transitions, 265 flow. Second operand 6 states and 535 transitions. [2025-03-04 06:59:38,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 135 transitions, 421 flow [2025-03-04 06:59:38,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 135 transitions, 415 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:38,783 INFO L231 Difference]: Finished difference. Result has 121 places, 111 transitions, 267 flow [2025-03-04 06:59:38,783 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-04 06:59:38,783 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 6 predicate places. [2025-03-04 06:59:38,784 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 111 transitions, 267 flow [2025-03-04 06:59:38,784 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-04 06:59:38,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:38,784 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-04 06:59:38,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:59:38,784 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-04 06:59:38,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:38,785 INFO L85 PathProgramCache]: Analyzing trace with hash 525504629, now seen corresponding path program 1 times [2025-03-04 06:59:38,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:38,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980405881] [2025-03-04 06:59:38,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:38,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:38,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:59:38,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:59:38,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:38,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:38,806 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-04 06:59:38,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:38,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980405881] [2025-03-04 06:59:38,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980405881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:38,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:38,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:38,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063729505] [2025-03-04 06:59:38,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:38,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:38,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:38,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:38,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:38,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2025-03-04 06:59:38,820 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-04 06:59:38,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:38,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2025-03-04 06:59:38,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:39,101 INFO L124 PetriNetUnfolderBase]: 1023/4159 cut-off events. [2025-03-04 06:59:39,101 INFO L125 PetriNetUnfolderBase]: For 676/930 co-relation queries the response was YES. [2025-03-04 06:59:39,113 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 39657 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-04 06:59:39,127 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 27 selfloop transitions, 6 changer transitions 0/124 dead transitions. [2025-03-04 06:59:39,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 124 transitions, 377 flow [2025-03-04 06:59:39,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2025-03-04 06:59:39,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219219219219219 [2025-03-04 06:59:39,128 INFO L175 Difference]: Start difference. First operand has 121 places, 111 transitions, 267 flow. Second operand 3 states and 307 transitions. [2025-03-04 06:59:39,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 124 transitions, 377 flow [2025-03-04 06:59:39,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 124 transitions, 367 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:59:39,130 INFO L231 Difference]: Finished difference. Result has 120 places, 116 transitions, 303 flow [2025-03-04 06:59:39,130 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-04 06:59:39,131 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 5 predicate places. [2025-03-04 06:59:39,131 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 116 transitions, 303 flow [2025-03-04 06:59:39,131 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-04 06:59:39,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:39,131 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-04 06:59:39,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:59:39,131 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-04 06:59:39,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:39,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2069678429, now seen corresponding path program 1 times [2025-03-04 06:59:39,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:39,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608223831] [2025-03-04 06:59:39,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:39,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:39,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 06:59:39,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 06:59:39,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:39,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:39,165 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-04 06:59:39,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:39,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608223831] [2025-03-04 06:59:39,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608223831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:39,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:39,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:59:39,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693087477] [2025-03-04 06:59:39,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:39,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:59:39,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:39,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:59:39,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:59:39,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2025-03-04 06:59:39,189 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-04 06:59:39,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:39,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2025-03-04 06:59:39,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:39,420 INFO L124 PetriNetUnfolderBase]: 662/3141 cut-off events. [2025-03-04 06:59:39,421 INFO L125 PetriNetUnfolderBase]: For 430/450 co-relation queries the response was YES. [2025-03-04 06:59:39,429 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 28350 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-04 06:59:39,437 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 31 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2025-03-04 06:59:39,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 132 transitions, 414 flow [2025-03-04 06:59:39,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:59:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 06:59:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2025-03-04 06:59:39,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2025-03-04 06:59:39,439 INFO L175 Difference]: Start difference. First operand has 120 places, 116 transitions, 303 flow. Second operand 4 states and 404 transitions. [2025-03-04 06:59:39,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 132 transitions, 414 flow [2025-03-04 06:59:39,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 132 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:39,442 INFO L231 Difference]: Finished difference. Result has 122 places, 117 transitions, 307 flow [2025-03-04 06:59:39,442 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-04 06:59:39,442 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 7 predicate places. [2025-03-04 06:59:39,442 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 117 transitions, 307 flow [2025-03-04 06:59:39,442 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-04 06:59:39,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:39,443 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-04 06:59:39,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:59:39,443 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-04 06:59:39,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:39,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1087165987, now seen corresponding path program 1 times [2025-03-04 06:59:39,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:39,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110032108] [2025-03-04 06:59:39,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:39,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:39,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:59:39,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:59:39,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:39,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:39,497 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-04 06:59:39,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:39,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110032108] [2025-03-04 06:59:39,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110032108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:39,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:39,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:59:39,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756710008] [2025-03-04 06:59:39,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:39,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:39,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:39,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:39,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2025-03-04 06:59:39,553 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-04 06:59:39,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:39,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2025-03-04 06:59:39,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:39,971 INFO L124 PetriNetUnfolderBase]: 950/4761 cut-off events. [2025-03-04 06:59:39,971 INFO L125 PetriNetUnfolderBase]: For 649/649 co-relation queries the response was YES. [2025-03-04 06:59:39,985 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 47777 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-04 06:59:39,997 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 35 selfloop transitions, 7 changer transitions 0/137 dead transitions. [2025-03-04 06:59:39,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 137 transitions, 433 flow [2025-03-04 06:59:39,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:59:39,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 06:59:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 673 transitions. [2025-03-04 06:59:39,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8661518661518661 [2025-03-04 06:59:39,999 INFO L175 Difference]: Start difference. First operand has 122 places, 117 transitions, 307 flow. Second operand 7 states and 673 transitions. [2025-03-04 06:59:39,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 137 transitions, 433 flow [2025-03-04 06:59:40,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 137 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:40,004 INFO L231 Difference]: Finished difference. Result has 129 places, 120 transitions, 337 flow [2025-03-04 06:59:40,004 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-04 06:59:40,004 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 14 predicate places. [2025-03-04 06:59:40,005 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 120 transitions, 337 flow [2025-03-04 06:59:40,005 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-04 06:59:40,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:40,005 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-04 06:59:40,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:59:40,005 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-04 06:59:40,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:40,006 INFO L85 PathProgramCache]: Analyzing trace with hash 641336527, now seen corresponding path program 1 times [2025-03-04 06:59:40,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:40,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625044825] [2025-03-04 06:59:40,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:40,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:40,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:59:40,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:59:40,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:40,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:40,030 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-04 06:59:40,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:40,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625044825] [2025-03-04 06:59:40,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625044825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:40,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:40,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:40,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856582280] [2025-03-04 06:59:40,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:40,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:40,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:40,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:40,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:40,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2025-03-04 06:59:40,047 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-04 06:59:40,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:40,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2025-03-04 06:59:40,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:40,322 INFO L124 PetriNetUnfolderBase]: 938/3984 cut-off events. [2025-03-04 06:59:40,322 INFO L125 PetriNetUnfolderBase]: For 1268/1455 co-relation queries the response was YES. [2025-03-04 06:59:40,333 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 39532 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-04 06:59:40,343 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 28 selfloop transitions, 9 changer transitions 0/134 dead transitions. [2025-03-04 06:59:40,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 134 transitions, 462 flow [2025-03-04 06:59:40,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2025-03-04 06:59:40,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2025-03-04 06:59:40,344 INFO L175 Difference]: Start difference. First operand has 129 places, 120 transitions, 337 flow. Second operand 3 states and 306 transitions. [2025-03-04 06:59:40,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 134 transitions, 462 flow [2025-03-04 06:59:40,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 134 transitions, 452 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 06:59:40,347 INFO L231 Difference]: Finished difference. Result has 130 places, 127 transitions, 403 flow [2025-03-04 06:59:40,348 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-04 06:59:40,348 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 15 predicate places. [2025-03-04 06:59:40,348 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 127 transitions, 403 flow [2025-03-04 06:59:40,348 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-04 06:59:40,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:40,348 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-04 06:59:40,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:59:40,349 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-04 06:59:40,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:40,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1859988941, now seen corresponding path program 1 times [2025-03-04 06:59:40,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:40,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092650011] [2025-03-04 06:59:40,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:40,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:40,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:59:40,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:59:40,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:40,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:40,441 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-04 06:59:40,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:40,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092650011] [2025-03-04 06:59:40,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092650011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:40,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:40,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:59:40,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409967429] [2025-03-04 06:59:40,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:40,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:59:40,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:40,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:59:40,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:59:40,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2025-03-04 06:59:40,517 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-04 06:59:40,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:40,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2025-03-04 06:59:40,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:40,987 INFO L124 PetriNetUnfolderBase]: 1255/6166 cut-off events. [2025-03-04 06:59:40,987 INFO L125 PetriNetUnfolderBase]: For 1548/2574 co-relation queries the response was YES. [2025-03-04 06:59:41,004 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 65376 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-04 06:59:41,019 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 47 selfloop transitions, 10 changer transitions 0/159 dead transitions. [2025-03-04 06:59:41,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 159 transitions, 585 flow [2025-03-04 06:59:41,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:59:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 06:59:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 958 transitions. [2025-03-04 06:59:41,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.863063063063063 [2025-03-04 06:59:41,023 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 403 flow. Second operand 10 states and 958 transitions. [2025-03-04 06:59:41,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 159 transitions, 585 flow [2025-03-04 06:59:41,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 159 transitions, 567 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:41,029 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 425 flow [2025-03-04 06:59:41,029 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-04 06:59:41,029 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 25 predicate places. [2025-03-04 06:59:41,029 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 425 flow [2025-03-04 06:59:41,030 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-04 06:59:41,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:41,030 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-04 06:59:41,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:59:41,030 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-04 06:59:41,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:41,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1108435485, now seen corresponding path program 1 times [2025-03-04 06:59:41,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:41,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773209547] [2025-03-04 06:59:41,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:41,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:41,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:59:41,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:59:41,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:41,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:41,080 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-04 06:59:41,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:41,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773209547] [2025-03-04 06:59:41,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773209547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:41,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:41,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:59:41,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401427597] [2025-03-04 06:59:41,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:41,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:41,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:41,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:41,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:41,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 111 [2025-03-04 06:59:41,089 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-04 06:59:41,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:41,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 111 [2025-03-04 06:59:41,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:41,182 INFO L124 PetriNetUnfolderBase]: 91/1220 cut-off events. [2025-03-04 06:59:41,182 INFO L125 PetriNetUnfolderBase]: For 292/352 co-relation queries the response was YES. [2025-03-04 06:59:41,185 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 8858 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-04 06:59:41,187 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 12 selfloop transitions, 6 changer transitions 0/128 dead transitions. [2025-03-04 06:59:41,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 128 transitions, 456 flow [2025-03-04 06:59:41,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2025-03-04 06:59:41,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9459459459459459 [2025-03-04 06:59:41,188 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 425 flow. Second operand 3 states and 315 transitions. [2025-03-04 06:59:41,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 128 transitions, 456 flow [2025-03-04 06:59:41,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 128 transitions, 430 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 06:59:41,191 INFO L231 Difference]: Finished difference. Result has 136 places, 123 transitions, 375 flow [2025-03-04 06:59:41,191 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-04 06:59:41,191 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 21 predicate places. [2025-03-04 06:59:41,191 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 123 transitions, 375 flow [2025-03-04 06:59:41,191 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-04 06:59:41,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:41,192 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-04 06:59:41,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:59:41,192 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-04 06:59:41,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:41,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2061578932, now seen corresponding path program 1 times [2025-03-04 06:59:41,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:41,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209033873] [2025-03-04 06:59:41,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:41,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:41,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:59:41,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:59:41,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:41,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:41,220 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-04 06:59:41,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:41,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209033873] [2025-03-04 06:59:41,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209033873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:41,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:41,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:41,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020186619] [2025-03-04 06:59:41,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:41,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:41,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:41,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:41,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:41,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2025-03-04 06:59:41,235 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-04 06:59:41,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:41,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2025-03-04 06:59:41,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:41,328 INFO L124 PetriNetUnfolderBase]: 177/1401 cut-off events. [2025-03-04 06:59:41,328 INFO L125 PetriNetUnfolderBase]: For 701/749 co-relation queries the response was YES. [2025-03-04 06:59:41,331 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 10851 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-04 06:59:41,334 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 23 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2025-03-04 06:59:41,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 128 transitions, 449 flow [2025-03-04 06:59:41,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2025-03-04 06:59:41,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8978978978978979 [2025-03-04 06:59:41,335 INFO L175 Difference]: Start difference. First operand has 136 places, 123 transitions, 375 flow. Second operand 3 states and 299 transitions. [2025-03-04 06:59:41,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 128 transitions, 449 flow [2025-03-04 06:59:41,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 128 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:59:41,338 INFO L231 Difference]: Finished difference. Result has 139 places, 126 transitions, 403 flow [2025-03-04 06:59:41,338 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-04 06:59:41,339 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 24 predicate places. [2025-03-04 06:59:41,339 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 126 transitions, 403 flow [2025-03-04 06:59:41,339 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-04 06:59:41,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:41,339 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-04 06:59:41,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:59:41,339 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-04 06:59:41,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:41,340 INFO L85 PathProgramCache]: Analyzing trace with hash 287571614, now seen corresponding path program 1 times [2025-03-04 06:59:41,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:41,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991638950] [2025-03-04 06:59:41,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:41,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:59:41,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:59:41,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:41,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:41,465 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-04 06:59:41,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991638950] [2025-03-04 06:59:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991638950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:41,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:41,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:59:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124916879] [2025-03-04 06:59:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:41,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:59:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:41,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:59:41,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:59:41,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 111 [2025-03-04 06:59:41,526 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-04 06:59:41,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:41,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 111 [2025-03-04 06:59:41,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:41,705 INFO L124 PetriNetUnfolderBase]: 151/816 cut-off events. [2025-03-04 06:59:41,705 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2025-03-04 06:59:41,707 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 4797 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-04 06:59:41,708 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 50 selfloop transitions, 11 changer transitions 0/125 dead transitions. [2025-03-04 06:59:41,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 125 transitions, 498 flow [2025-03-04 06:59:41,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 06:59:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 06:59:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1219 transitions. [2025-03-04 06:59:41,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8447678447678447 [2025-03-04 06:59:41,711 INFO L175 Difference]: Start difference. First operand has 139 places, 126 transitions, 403 flow. Second operand 13 states and 1219 transitions. [2025-03-04 06:59:41,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 125 transitions, 498 flow [2025-03-04 06:59:41,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 125 transitions, 460 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-03-04 06:59:41,713 INFO L231 Difference]: Finished difference. Result has 112 places, 86 transitions, 246 flow [2025-03-04 06:59:41,713 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-04 06:59:41,713 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2025-03-04 06:59:41,713 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 86 transitions, 246 flow [2025-03-04 06:59:41,714 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-04 06:59:41,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:41,714 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-04 06:59:41,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:59:41,714 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-04 06:59:41,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:41,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1525594578, now seen corresponding path program 1 times [2025-03-04 06:59:41,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:41,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702952613] [2025-03-04 06:59:41,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:41,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:41,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 06:59:41,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 06:59:41,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:41,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:59:41,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:59:41,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 06:59:41,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 06:59:41,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:41,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:59:41,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:59:41,752 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:59:41,752 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-04 06:59:41,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-03-04 06:59:41,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-03-04 06:59:41,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-03-04 06:59:41,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-03-04 06:59:41,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-03-04 06:59:41,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-03-04 06:59:41,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-03-04 06:59:41,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 06:59:41,754 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:59:41,754 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:59:41,754 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 06:59:41,775 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 06:59:41,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 129 transitions, 298 flow [2025-03-04 06:59:41,815 INFO L124 PetriNetUnfolderBase]: 21/544 cut-off events. [2025-03-04 06:59:41,815 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 06:59:41,816 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 2072 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-04 06:59:41,816 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 129 transitions, 298 flow [2025-03-04 06:59:41,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 129 transitions, 298 flow [2025-03-04 06:59:41,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:59:41,820 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;@6dc57cfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:59:41,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 06:59:41,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:59:41,825 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-04 06:59:41,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:59:41,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:41,825 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-04 06:59:41,825 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-04 06:59:41,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:41,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2065384472, now seen corresponding path program 1 times [2025-03-04 06:59:41,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:41,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767333137] [2025-03-04 06:59:41,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:41,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:41,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 06:59:41,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 06:59:41,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:41,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:41,856 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-04 06:59:41,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:41,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767333137] [2025-03-04 06:59:41,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767333137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:41,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:41,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:59:41,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809596031] [2025-03-04 06:59:41,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:41,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:59:41,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:41,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:59:41,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:59:41,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-03-04 06:59:41,880 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-04 06:59:41,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:41,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-03-04 06:59:41,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:42,513 INFO L124 PetriNetUnfolderBase]: 2017/8193 cut-off events. [2025-03-04 06:59:42,514 INFO L125 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2025-03-04 06:59:42,527 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 83712 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-04 06:59:42,543 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 30 selfloop transitions, 4 changer transitions 0/140 dead transitions. [2025-03-04 06:59:42,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 140 transitions, 388 flow [2025-03-04 06:59:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:59:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 06:59:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2025-03-04 06:59:42,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8895348837209303 [2025-03-04 06:59:42,544 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 298 flow. Second operand 4 states and 459 transitions. [2025-03-04 06:59:42,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 140 transitions, 388 flow [2025-03-04 06:59:42,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 140 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:42,546 INFO L231 Difference]: Finished difference. Result has 138 places, 130 transitions, 314 flow [2025-03-04 06:59:42,546 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-04 06:59:42,547 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 4 predicate places. [2025-03-04 06:59:42,547 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 130 transitions, 314 flow [2025-03-04 06:59:42,547 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-04 06:59:42,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:42,547 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-04 06:59:42,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 06:59:42,547 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-04 06:59:42,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:42,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1940224579, now seen corresponding path program 1 times [2025-03-04 06:59:42,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:42,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898468637] [2025-03-04 06:59:42,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:42,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:42,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:59:42,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:59:42,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:42,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:42,653 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-04 06:59:42,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:42,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898468637] [2025-03-04 06:59:42,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898468637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:42,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:42,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:42,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385238931] [2025-03-04 06:59:42,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:42,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:42,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:42,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:42,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:42,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 129 [2025-03-04 06:59:42,711 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-04 06:59:42,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:42,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 129 [2025-03-04 06:59:42,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:43,877 INFO L124 PetriNetUnfolderBase]: 6248/15570 cut-off events. [2025-03-04 06:59:43,877 INFO L125 PetriNetUnfolderBase]: For 1593/1593 co-relation queries the response was YES. [2025-03-04 06:59:43,916 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 157760 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-04 06:59:43,962 INFO L140 encePairwiseOnDemand]: 123/129 looper letters, 62 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2025-03-04 06:59:43,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 161 transitions, 510 flow [2025-03-04 06:59:43,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 631 transitions. [2025-03-04 06:59:43,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8152454780361758 [2025-03-04 06:59:43,963 INFO L175 Difference]: Start difference. First operand has 138 places, 130 transitions, 314 flow. Second operand 6 states and 631 transitions. [2025-03-04 06:59:43,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 161 transitions, 510 flow [2025-03-04 06:59:43,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 161 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:43,974 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 316 flow [2025-03-04 06:59:43,974 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-04 06:59:43,975 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 6 predicate places. [2025-03-04 06:59:43,975 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 316 flow [2025-03-04 06:59:43,975 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-04 06:59:43,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:43,975 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-04 06:59:43,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 06:59:43,976 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-04 06:59:43,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:43,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2006916278, now seen corresponding path program 1 times [2025-03-04 06:59:43,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:43,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741514206] [2025-03-04 06:59:43,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:43,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:43,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:59:43,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:59:43,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:43,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:43,992 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-04 06:59:43,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:43,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741514206] [2025-03-04 06:59:43,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741514206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:43,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:43,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:43,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260689328] [2025-03-04 06:59:43,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:43,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:43,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:43,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:43,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:44,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-03-04 06:59:44,011 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-04 06:59:44,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:44,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-03-04 06:59:44,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:45,986 INFO L124 PetriNetUnfolderBase]: 7160/22223 cut-off events. [2025-03-04 06:59:45,986 INFO L125 PetriNetUnfolderBase]: For 5010/5524 co-relation queries the response was YES. [2025-03-04 06:59:46,041 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 265729 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-04 06:59:46,107 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 36 selfloop transitions, 7 changer transitions 0/147 dead transitions. [2025-03-04 06:59:46,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 147 transitions, 468 flow [2025-03-04 06:59:46,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-03-04 06:59:46,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9198966408268734 [2025-03-04 06:59:46,108 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 316 flow. Second operand 3 states and 356 transitions. [2025-03-04 06:59:46,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 147 transitions, 468 flow [2025-03-04 06:59:46,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 147 transitions, 458 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:59:46,113 INFO L231 Difference]: Finished difference. Result has 139 places, 135 transitions, 360 flow [2025-03-04 06:59:46,114 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-04 06:59:46,114 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 5 predicate places. [2025-03-04 06:59:46,114 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 135 transitions, 360 flow [2025-03-04 06:59:46,114 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-04 06:59:46,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:46,114 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-04 06:59:46,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 06:59:46,115 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-04 06:59:46,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1452452498, now seen corresponding path program 1 times [2025-03-04 06:59:46,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:46,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946015435] [2025-03-04 06:59:46,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:46,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 06:59:46,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 06:59:46,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:46,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:46,150 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-04 06:59:46,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:46,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946015435] [2025-03-04 06:59:46,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946015435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:46,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:46,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:59:46,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396636213] [2025-03-04 06:59:46,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:46,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:59:46,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:46,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:59:46,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:59:46,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-03-04 06:59:46,178 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-04 06:59:46,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:46,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-03-04 06:59:46,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:47,597 INFO L124 PetriNetUnfolderBase]: 4968/18140 cut-off events. [2025-03-04 06:59:47,597 INFO L125 PetriNetUnfolderBase]: For 2733/2797 co-relation queries the response was YES. [2025-03-04 06:59:47,647 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 220521 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-04 06:59:47,701 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 40 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2025-03-04 06:59:47,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 156 transitions, 502 flow [2025-03-04 06:59:47,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:59:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 06:59:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2025-03-04 06:59:47,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9089147286821705 [2025-03-04 06:59:47,702 INFO L175 Difference]: Start difference. First operand has 139 places, 135 transitions, 360 flow. Second operand 4 states and 469 transitions. [2025-03-04 06:59:47,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 156 transitions, 502 flow [2025-03-04 06:59:47,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 156 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:47,712 INFO L231 Difference]: Finished difference. Result has 141 places, 136 transitions, 362 flow [2025-03-04 06:59:47,712 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-04 06:59:47,713 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 7 predicate places. [2025-03-04 06:59:47,713 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 136 transitions, 362 flow [2025-03-04 06:59:47,713 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-04 06:59:47,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:47,713 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-04 06:59:47,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 06:59:47,713 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-04 06:59:47,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:47,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1456524429, now seen corresponding path program 1 times [2025-03-04 06:59:47,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:47,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206822082] [2025-03-04 06:59:47,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:47,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:47,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:59:47,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:59:47,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:47,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:47,776 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-04 06:59:47,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:47,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206822082] [2025-03-04 06:59:47,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206822082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:47,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:47,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:59:47,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611122448] [2025-03-04 06:59:47,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:47,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:47,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:47,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:47,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-03-04 06:59:47,813 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-04 06:59:47,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:47,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-03-04 06:59:47,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:49,962 INFO L124 PetriNetUnfolderBase]: 6364/23537 cut-off events. [2025-03-04 06:59:49,962 INFO L125 PetriNetUnfolderBase]: For 3160/3160 co-relation queries the response was YES. [2025-03-04 06:59:50,049 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 298169 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-04 06:59:50,117 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 41 selfloop transitions, 7 changer transitions 0/158 dead transitions. [2025-03-04 06:59:50,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 158 transitions, 504 flow [2025-03-04 06:59:50,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:59:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 06:59:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2025-03-04 06:59:50,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8604651162790697 [2025-03-04 06:59:50,119 INFO L175 Difference]: Start difference. First operand has 141 places, 136 transitions, 362 flow. Second operand 7 states and 777 transitions. [2025-03-04 06:59:50,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 158 transitions, 504 flow [2025-03-04 06:59:50,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 158 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:50,126 INFO L231 Difference]: Finished difference. Result has 148 places, 139 transitions, 392 flow [2025-03-04 06:59:50,126 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-04 06:59:50,127 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 14 predicate places. [2025-03-04 06:59:50,127 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 139 transitions, 392 flow [2025-03-04 06:59:50,127 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-04 06:59:50,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:50,127 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-04 06:59:50,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 06:59:50,128 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-04 06:59:50,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:50,128 INFO L85 PathProgramCache]: Analyzing trace with hash -655616481, now seen corresponding path program 1 times [2025-03-04 06:59:50,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:50,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897298567] [2025-03-04 06:59:50,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:50,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:50,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:59:50,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:59:50,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:50,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:50,147 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-04 06:59:50,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:50,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897298567] [2025-03-04 06:59:50,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897298567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:50,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:50,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:50,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700771365] [2025-03-04 06:59:50,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:50,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:50,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:50,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:50,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:50,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-03-04 06:59:50,163 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-04 06:59:50,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:50,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-03-04 06:59:50,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:52,912 INFO L124 PetriNetUnfolderBase]: 8620/30231 cut-off events. [2025-03-04 06:59:52,913 INFO L125 PetriNetUnfolderBase]: For 11504/13519 co-relation queries the response was YES. [2025-03-04 06:59:53,017 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 394843 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-04 06:59:53,132 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 38 selfloop transitions, 11 changer transitions 0/159 dead transitions. [2025-03-04 06:59:53,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 159 transitions, 569 flow [2025-03-04 06:59:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2025-03-04 06:59:53,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.917312661498708 [2025-03-04 06:59:53,133 INFO L175 Difference]: Start difference. First operand has 148 places, 139 transitions, 392 flow. Second operand 3 states and 355 transitions. [2025-03-04 06:59:53,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 159 transitions, 569 flow [2025-03-04 06:59:53,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 159 transitions, 559 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 06:59:53,160 INFO L231 Difference]: Finished difference. Result has 149 places, 148 transitions, 478 flow [2025-03-04 06:59:53,160 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-04 06:59:53,160 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 15 predicate places. [2025-03-04 06:59:53,160 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 148 transitions, 478 flow [2025-03-04 06:59:53,160 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-04 06:59:53,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:53,160 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-04 06:59:53,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 06:59:53,161 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-04 06:59:53,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:53,162 INFO L85 PathProgramCache]: Analyzing trace with hash 986531092, now seen corresponding path program 1 times [2025-03-04 06:59:53,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:53,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293676012] [2025-03-04 06:59:53,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:53,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:53,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:59:53,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:59:53,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:53,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:53,257 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-04 06:59:53,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:53,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293676012] [2025-03-04 06:59:53,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293676012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:53,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:53,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:59:53,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026272535] [2025-03-04 06:59:53,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:53,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:59:53,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:53,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:59:53,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:59:53,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-03-04 06:59:53,314 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-04 06:59:53,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:53,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-03-04 06:59:53,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:56,820 INFO L124 PetriNetUnfolderBase]: 9234/35955 cut-off events. [2025-03-04 06:59:56,820 INFO L125 PetriNetUnfolderBase]: For 10342/19346 co-relation queries the response was YES. [2025-03-04 06:59:56,969 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 495386 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-04 06:59:57,241 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 55 selfloop transitions, 10 changer transitions 0/184 dead transitions. [2025-03-04 06:59:57,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 184 transitions, 690 flow [2025-03-04 06:59:57,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:59:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 06:59:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1106 transitions. [2025-03-04 06:59:57,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8573643410852713 [2025-03-04 06:59:57,243 INFO L175 Difference]: Start difference. First operand has 149 places, 148 transitions, 478 flow. Second operand 10 states and 1106 transitions. [2025-03-04 06:59:57,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 184 transitions, 690 flow [2025-03-04 06:59:57,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 184 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:57,277 INFO L231 Difference]: Finished difference. Result has 159 places, 151 transitions, 504 flow [2025-03-04 06:59:57,277 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-04 06:59:57,278 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 25 predicate places. [2025-03-04 06:59:57,278 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 151 transitions, 504 flow [2025-03-04 06:59:57,278 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-04 06:59:57,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:57,279 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-04 06:59:57,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 06:59:57,279 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-04 06:59:57,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:57,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2004117395, now seen corresponding path program 1 times [2025-03-04 06:59:57,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:57,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824054014] [2025-03-04 06:59:57,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:57,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:57,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:59:57,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:59:57,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:57,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:57,317 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-04 06:59:57,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:57,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824054014] [2025-03-04 06:59:57,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824054014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:57,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:57,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:59:57,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532593557] [2025-03-04 06:59:57,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:57,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:57,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:57,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:57,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:57,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 129 [2025-03-04 06:59:57,327 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-04 06:59:57,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:57,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 129 [2025-03-04 06:59:57,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:57,650 INFO L124 PetriNetUnfolderBase]: 472/4722 cut-off events. [2025-03-04 06:59:57,651 INFO L125 PetriNetUnfolderBase]: For 1435/1689 co-relation queries the response was YES. [2025-03-04 06:59:57,666 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 50859 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-04 06:59:57,673 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 16 selfloop transitions, 8 changer transitions 0/149 dead transitions. [2025-03-04 06:59:57,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 149 transitions, 545 flow [2025-03-04 06:59:57,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-03-04 06:59:57,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405684754521964 [2025-03-04 06:59:57,674 INFO L175 Difference]: Start difference. First operand has 159 places, 151 transitions, 504 flow. Second operand 3 states and 364 transitions. [2025-03-04 06:59:57,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 149 transitions, 545 flow [2025-03-04 06:59:57,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 149 transitions, 519 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 06:59:57,682 INFO L231 Difference]: Finished difference. Result has 155 places, 142 transitions, 440 flow [2025-03-04 06:59:57,683 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-04 06:59:57,683 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 21 predicate places. [2025-03-04 06:59:57,683 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 142 transitions, 440 flow [2025-03-04 06:59:57,683 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-04 06:59:57,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:57,683 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-04 06:59:57,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 06:59:57,683 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-04 06:59:57,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1152275173, now seen corresponding path program 1 times [2025-03-04 06:59:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817706901] [2025-03-04 06:59:57,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:57,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:59:57,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:59:57,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:57,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:57,712 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-04 06:59:57,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:57,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817706901] [2025-03-04 06:59:57,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817706901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:57,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:57,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:57,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112642953] [2025-03-04 06:59:57,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:57,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:57,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:57,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:57,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:57,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-03-04 06:59:57,729 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-04 06:59:57,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:57,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-03-04 06:59:57,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:58,162 INFO L124 PetriNetUnfolderBase]: 934/5912 cut-off events. [2025-03-04 06:59:58,164 INFO L125 PetriNetUnfolderBase]: For 3710/3812 co-relation queries the response was YES. [2025-03-04 06:59:58,184 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 66659 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-04 06:59:58,195 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 30 selfloop transitions, 4 changer transitions 0/149 dead transitions. [2025-03-04 06:59:58,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 149 transitions, 544 flow [2025-03-04 06:59:58,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2025-03-04 06:59:58,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8914728682170543 [2025-03-04 06:59:58,196 INFO L175 Difference]: Start difference. First operand has 155 places, 142 transitions, 440 flow. Second operand 3 states and 345 transitions. [2025-03-04 06:59:58,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 149 transitions, 544 flow [2025-03-04 06:59:58,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 149 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:59:58,199 INFO L231 Difference]: Finished difference. Result has 158 places, 145 transitions, 466 flow [2025-03-04 06:59:58,199 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-04 06:59:58,199 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 24 predicate places. [2025-03-04 06:59:58,199 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 145 transitions, 466 flow [2025-03-04 06:59:58,200 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-04 06:59:58,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:58,200 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-04 06:59:58,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 06:59:58,200 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-04 06:59:58,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1444419218, now seen corresponding path program 1 times [2025-03-04 06:59:58,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:58,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795589108] [2025-03-04 06:59:58,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:58,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:58,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:59:58,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:59:58,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:58,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:58,298 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-04 06:59:58,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795589108] [2025-03-04 06:59:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795589108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:58,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:58,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:59:58,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81068230] [2025-03-04 06:59:58,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:58,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:59:58,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:58,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:59:58,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:59:58,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2025-03-04 06:59:58,376 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-04 06:59:58,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:58,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2025-03-04 06:59:58,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:59,399 INFO L124 PetriNetUnfolderBase]: 1216/8139 cut-off events. [2025-03-04 06:59:59,400 INFO L125 PetriNetUnfolderBase]: For 3460/3688 co-relation queries the response was YES. [2025-03-04 06:59:59,429 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 88378 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-04 06:59:59,444 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 76 selfloop transitions, 14 changer transitions 1/203 dead transitions. [2025-03-04 06:59:59,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 203 transitions, 824 flow [2025-03-04 06:59:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 06:59:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 06:59:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1431 transitions. [2025-03-04 06:59:59,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.853309481216458 [2025-03-04 06:59:59,446 INFO L175 Difference]: Start difference. First operand has 158 places, 145 transitions, 466 flow. Second operand 13 states and 1431 transitions. [2025-03-04 06:59:59,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 203 transitions, 824 flow [2025-03-04 06:59:59,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 203 transitions, 812 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:59,452 INFO L231 Difference]: Finished difference. Result has 172 places, 148 transitions, 516 flow [2025-03-04 06:59:59,452 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-04 06:59:59,453 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 38 predicate places. [2025-03-04 06:59:59,453 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 148 transitions, 516 flow [2025-03-04 06:59:59,453 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-04 06:59:59,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:59,453 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-04 06:59:59,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 06:59:59,454 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-04 06:59:59,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1901602830, now seen corresponding path program 1 times [2025-03-04 06:59:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:59,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931402147] [2025-03-04 06:59:59,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:59,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:59,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 06:59:59,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 06:59:59,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:59,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:59,484 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-04 06:59:59,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:59,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931402147] [2025-03-04 06:59:59,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931402147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:59,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:59,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:59,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088717300] [2025-03-04 06:59:59,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:59,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:59,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:59,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:59,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:59,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-03-04 06:59:59,502 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-04 06:59:59,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:59,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-03-04 06:59:59,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:00,080 INFO L124 PetriNetUnfolderBase]: 883/5630 cut-off events. [2025-03-04 07:00:00,080 INFO L125 PetriNetUnfolderBase]: For 4117/4213 co-relation queries the response was YES. [2025-03-04 07:00:00,098 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 61469 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-04 07:00:00,109 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 30 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2025-03-04 07:00:00,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 154 transitions, 611 flow [2025-03-04 07:00:00,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2025-03-04 07:00:00,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-03-04 07:00:00,110 INFO L175 Difference]: Start difference. First operand has 172 places, 148 transitions, 516 flow. Second operand 3 states and 344 transitions. [2025-03-04 07:00:00,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 154 transitions, 611 flow [2025-03-04 07:00:00,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 154 transitions, 581 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-03-04 07:00:00,120 INFO L231 Difference]: Finished difference. Result has 168 places, 151 transitions, 522 flow [2025-03-04 07:00:00,120 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-04 07:00:00,120 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 34 predicate places. [2025-03-04 07:00:00,120 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 151 transitions, 522 flow [2025-03-04 07:00:00,121 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-04 07:00:00,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:00,121 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-04 07:00:00,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 07:00:00,121 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-04 07:00:00,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:00,122 INFO L85 PathProgramCache]: Analyzing trace with hash -220388779, now seen corresponding path program 1 times [2025-03-04 07:00:00,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:00,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956830755] [2025-03-04 07:00:00,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:00,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:00,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 07:00:00,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 07:00:00,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:00,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:00,404 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-04 07:00:00,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:00,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956830755] [2025-03-04 07:00:00,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956830755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:00,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:00,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:00:00,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700202482] [2025-03-04 07:00:00,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:00,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:00:00,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:00,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:00:00,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:00:00,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 129 [2025-03-04 07:00:00,481 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-04 07:00:00,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:00,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 129 [2025-03-04 07:00:00,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:01,779 INFO L124 PetriNetUnfolderBase]: 2726/11128 cut-off events. [2025-03-04 07:00:01,779 INFO L125 PetriNetUnfolderBase]: For 4547/4832 co-relation queries the response was YES. [2025-03-04 07:00:01,802 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 121832 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-04 07:00:01,817 INFO L140 encePairwiseOnDemand]: 123/129 looper letters, 59 selfloop transitions, 6 changer transitions 0/182 dead transitions. [2025-03-04 07:00:01,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 182 transitions, 746 flow [2025-03-04 07:00:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:00:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 07:00:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2025-03-04 07:00:01,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8281653746770026 [2025-03-04 07:00:01,818 INFO L175 Difference]: Start difference. First operand has 168 places, 151 transitions, 522 flow. Second operand 6 states and 641 transitions. [2025-03-04 07:00:01,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 182 transitions, 746 flow [2025-03-04 07:00:01,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 182 transitions, 732 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 07:00:01,838 INFO L231 Difference]: Finished difference. Result has 170 places, 150 transitions, 518 flow [2025-03-04 07:00:01,838 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-04 07:00:01,838 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 36 predicate places. [2025-03-04 07:00:01,838 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 150 transitions, 518 flow [2025-03-04 07:00:01,839 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-04 07:00:01,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:01,839 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-04 07:00:01,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 07:00:01,839 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-04 07:00:01,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:01,839 INFO L85 PathProgramCache]: Analyzing trace with hash -92497432, now seen corresponding path program 1 times [2025-03-04 07:00:01,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:01,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937070822] [2025-03-04 07:00:01,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:01,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:01,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 07:00:01,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 07:00:01,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:01,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:01,968 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-04 07:00:01,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:01,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937070822] [2025-03-04 07:00:01,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937070822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:01,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:01,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 07:00:01,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748934120] [2025-03-04 07:00:01,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:01,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:00:01,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:01,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:00:01,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:00:02,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2025-03-04 07:00:02,092 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-04 07:00:02,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:02,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2025-03-04 07:00:02,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:02,940 INFO L124 PetriNetUnfolderBase]: 1190/7524 cut-off events. [2025-03-04 07:00:02,940 INFO L125 PetriNetUnfolderBase]: For 4150/4378 co-relation queries the response was YES. [2025-03-04 07:00:02,961 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 80719 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-04 07:00:02,972 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 90 selfloop transitions, 16 changer transitions 8/227 dead transitions. [2025-03-04 07:00:02,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 227 transitions, 974 flow [2025-03-04 07:00:02,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:00:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 07:00:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1763 transitions. [2025-03-04 07:00:02,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2025-03-04 07:00:02,973 INFO L175 Difference]: Start difference. First operand has 170 places, 150 transitions, 518 flow. Second operand 16 states and 1763 transitions. [2025-03-04 07:00:02,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 227 transitions, 974 flow [2025-03-04 07:00:02,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 227 transitions, 954 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 07:00:02,981 INFO L231 Difference]: Finished difference. Result has 176 places, 148 transitions, 518 flow [2025-03-04 07:00:02,981 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-04 07:00:02,982 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 42 predicate places. [2025-03-04 07:00:02,982 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 148 transitions, 518 flow [2025-03-04 07:00:02,982 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-04 07:00:02,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:02,982 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-04 07:00:02,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 07:00:02,982 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-04 07:00:02,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:02,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1191582646, now seen corresponding path program 1 times [2025-03-04 07:00:02,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:02,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920424898] [2025-03-04 07:00:02,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:02,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:02,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 07:00:02,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 07:00:02,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:02,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:03,009 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-04 07:00:03,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:03,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920424898] [2025-03-04 07:00:03,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920424898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:03,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:03,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975519798] [2025-03-04 07:00:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:03,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:03,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:03,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-03-04 07:00:03,025 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-04 07:00:03,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:03,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-03-04 07:00:03,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:03,677 INFO L124 PetriNetUnfolderBase]: 1353/8854 cut-off events. [2025-03-04 07:00:03,678 INFO L125 PetriNetUnfolderBase]: For 5201/5285 co-relation queries the response was YES. [2025-03-04 07:00:03,708 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 105970 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-04 07:00:03,721 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 30 selfloop transitions, 9 changer transitions 1/161 dead transitions. [2025-03-04 07:00:03,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 161 transitions, 652 flow [2025-03-04 07:00:03,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2025-03-04 07:00:03,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.917312661498708 [2025-03-04 07:00:03,721 INFO L175 Difference]: Start difference. First operand has 176 places, 148 transitions, 518 flow. Second operand 3 states and 355 transitions. [2025-03-04 07:00:03,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 161 transitions, 652 flow [2025-03-04 07:00:03,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 161 transitions, 584 flow, removed 6 selfloop flow, removed 21 redundant places. [2025-03-04 07:00:03,751 INFO L231 Difference]: Finished difference. Result has 159 places, 152 transitions, 526 flow [2025-03-04 07:00:03,752 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-04 07:00:03,752 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 25 predicate places. [2025-03-04 07:00:03,752 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 152 transitions, 526 flow [2025-03-04 07:00:03,752 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-04 07:00:03,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:03,752 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-04 07:00:03,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 07:00:03,752 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-04 07:00:03,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:03,753 INFO L85 PathProgramCache]: Analyzing trace with hash 26026049, now seen corresponding path program 1 times [2025-03-04 07:00:03,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:03,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595464756] [2025-03-04 07:00:03,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:03,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:03,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 07:00:03,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 07:00:03,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:03,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:03,828 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-04 07:00:03,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:03,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595464756] [2025-03-04 07:00:03,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595464756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:03,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:03,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:00:03,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501206082] [2025-03-04 07:00:03,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:03,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:00:03,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:03,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:00:03,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:00:03,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-03-04 07:00:03,859 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-04 07:00:03,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:03,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-03-04 07:00:03,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:04,272 INFO L124 PetriNetUnfolderBase]: 806/5317 cut-off events. [2025-03-04 07:00:04,272 INFO L125 PetriNetUnfolderBase]: For 3505/3689 co-relation queries the response was YES. [2025-03-04 07:00:04,285 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 53077 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-04 07:00:04,292 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 5 changer transitions 8/185 dead transitions. [2025-03-04 07:00:04,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 185 transitions, 752 flow [2025-03-04 07:00:04,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:00:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 07:00:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2025-03-04 07:00:04,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9116279069767442 [2025-03-04 07:00:04,293 INFO L175 Difference]: Start difference. First operand has 159 places, 152 transitions, 526 flow. Second operand 5 states and 588 transitions. [2025-03-04 07:00:04,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 185 transitions, 752 flow [2025-03-04 07:00:04,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 185 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:00:04,299 INFO L231 Difference]: Finished difference. Result has 162 places, 153 transitions, 528 flow [2025-03-04 07:00:04,299 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-04 07:00:04,299 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 28 predicate places. [2025-03-04 07:00:04,299 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 153 transitions, 528 flow [2025-03-04 07:00:04,299 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-04 07:00:04,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:04,299 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-04 07:00:04,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-04 07:00:04,300 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-04 07:00:04,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2028201086, now seen corresponding path program 1 times [2025-03-04 07:00:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:04,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272627828] [2025-03-04 07:00:04,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:04,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 07:00:04,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 07:00:04,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:04,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:05,099 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-04 07:00:05,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:05,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272627828] [2025-03-04 07:00:05,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272627828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:00:05,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618016969] [2025-03-04 07:00:05,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:05,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:00:05,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:00:05,102 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-04 07:00:05,103 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-04 07:00:05,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 07:00:05,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 07:00:05,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:05,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:05,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 07:00:05,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:00:05,556 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-04 07:00:05,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:00:05,723 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-04 07:00:06,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:00:06,052 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-04 07:00:06,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:00:06,484 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-04 07:00:06,487 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-04 07:00:06,789 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-04 07:00:06,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618016969] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:00:06,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:00:06,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 18] total 55 [2025-03-04 07:00:06,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661716009] [2025-03-04 07:00:06,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:00:06,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-04 07:00:06,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:06,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-04 07:00:06,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2711, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 07:00:11,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 129 [2025-03-04 07:00:11,480 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-04 07:00:11,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:11,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 129 [2025-03-04 07:00:11,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:13,074 INFO L124 PetriNetUnfolderBase]: 1748/7093 cut-off events. [2025-03-04 07:00:13,075 INFO L125 PetriNetUnfolderBase]: For 3922/4118 co-relation queries the response was YES. [2025-03-04 07:00:13,094 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 69360 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-04 07:00:13,105 INFO L140 encePairwiseOnDemand]: 111/129 looper letters, 135 selfloop transitions, 28 changer transitions 8/278 dead transitions. [2025-03-04 07:00:13,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 278 transitions, 1239 flow [2025-03-04 07:00:13,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 07:00:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 07:00:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2521 transitions. [2025-03-04 07:00:13,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7817054263565891 [2025-03-04 07:00:13,107 INFO L175 Difference]: Start difference. First operand has 162 places, 153 transitions, 528 flow. Second operand 25 states and 2521 transitions. [2025-03-04 07:00:13,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 278 transitions, 1239 flow [2025-03-04 07:00:13,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 278 transitions, 1229 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 07:00:13,115 INFO L231 Difference]: Finished difference. Result has 191 places, 161 transitions, 626 flow [2025-03-04 07:00:13,115 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-04 07:00:13,115 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 57 predicate places. [2025-03-04 07:00:13,115 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 161 transitions, 626 flow [2025-03-04 07:00:13,117 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-04 07:00:13,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:13,117 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-04 07:00:13,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:00:13,318 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-04 07:00:13,318 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-04 07:00:13,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:13,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1563319830, now seen corresponding path program 2 times [2025-03-04 07:00:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:13,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571195194] [2025-03-04 07:00:13,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:00:13,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:13,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-03-04 07:00:13,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 07:00:13,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:00:13,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:14,168 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-04 07:00:14,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:14,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571195194] [2025-03-04 07:00:14,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571195194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:00:14,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839208742] [2025-03-04 07:00:14,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:00:14,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:00:14,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:00:14,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:00:14,172 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-04 07:00:14,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-03-04 07:00:14,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 07:00:14,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:00:14,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:14,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 07:00:14,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:00:15,238 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-04 07:00:15,358 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-03-04 07:00:15,358 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-04 07:00:15,680 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-04 07:00:15,709 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-04 07:00:15,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:00:16,083 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-04 07:00:16,086 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-04 07:00:16,548 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-04 07:00:16,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839208742] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:00:16,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:00:16,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 21] total 57 [2025-03-04 07:00:16,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628085745] [2025-03-04 07:00:16,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:00:16,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-04 07:00:16,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:16,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-04 07:00:16,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=2873, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 07:00:18,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:19,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:21,326 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-04 07:00:22,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:24,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:00:27,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 129 [2025-03-04 07:00:27,511 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.24561403508773) internal successors, (5144), 57 states have internal predecessors, (5144), 0 states have call successors, (0), 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-04 07:00:27,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:27,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 129 [2025-03-04 07:00:27,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:30,288 INFO L124 PetriNetUnfolderBase]: 1532/5648 cut-off events. [2025-03-04 07:00:30,289 INFO L125 PetriNetUnfolderBase]: For 3778/3886 co-relation queries the response was YES. [2025-03-04 07:00:30,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12515 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 50085 event pairs, 4 based on Foata normal form. 36/5605 useless extension candidates. Maximal degree in co-relation 7173. Up to 796 conditions per place. [2025-03-04 07:00:30,326 INFO L140 encePairwiseOnDemand]: 107/129 looper letters, 188 selfloop transitions, 41 changer transitions 16/347 dead transitions. [2025-03-04 07:00:30,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 347 transitions, 1689 flow [2025-03-04 07:00:30,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 07:00:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-04 07:00:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3466 transitions. [2025-03-04 07:00:30,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7261680284936098 [2025-03-04 07:00:30,330 INFO L175 Difference]: Start difference. First operand has 191 places, 161 transitions, 626 flow. Second operand 37 states and 3466 transitions. [2025-03-04 07:00:30,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 347 transitions, 1689 flow [2025-03-04 07:00:30,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 347 transitions, 1647 flow, removed 1 selfloop flow, removed 17 redundant places. [2025-03-04 07:00:30,342 INFO L231 Difference]: Finished difference. Result has 214 places, 168 transitions, 720 flow [2025-03-04 07:00:30,342 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-04 07:00:30,342 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 80 predicate places. [2025-03-04 07:00:30,342 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 168 transitions, 720 flow [2025-03-04 07:00:30,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 90.24561403508773) internal successors, (5144), 57 states have internal predecessors, (5144), 0 states have call successors, (0), 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-04 07:00:30,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:30,344 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-04 07:00:30,352 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-04 07:00:30,545 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-04 07:00:30,545 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-04 07:00:30,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:30,546 INFO L85 PathProgramCache]: Analyzing trace with hash -662142013, now seen corresponding path program 1 times [2025-03-04 07:00:30,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:30,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377314402] [2025-03-04 07:00:30,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:30,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:30,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 07:00:30,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 07:00:30,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:30,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:00:30,572 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:00:30,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 07:00:30,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 07:00:30,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:30,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:00:30,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:00:30,615 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:00:30,616 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-03-04 07:00:30,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-04 07:00:30,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-04 07:00:30,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-04 07:00:30,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-03-04 07:00:30,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-04 07:00:30,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-04 07:00:30,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-04 07:00:30,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-04 07:00:30,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-04 07:00:30,617 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-04 07:00:30,733 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2025-03-04 07:00:30,733 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:00:30,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:00:30 BasicIcfg [2025-03-04 07:00:30,740 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:00:30,740 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:00:30,740 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:00:30,740 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:00:30,741 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:59:34" (3/4) ... [2025-03-04 07:00:30,742 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 07:00:30,818 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-04 07:00:30,859 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:00:30,860 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:00:30,860 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:00:30,861 INFO L158 Benchmark]: Toolchain (without parser) took 57006.97ms. Allocated memory was 167.8MB in the beginning and 8.0GB in the end (delta: 7.9GB). Free memory was 122.5MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 5.8GB. Max. memory is 16.1GB. [2025-03-04 07:00:30,861 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:00:30,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.16ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 102.9MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:00:30,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.39ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 101.8MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:00:30,862 INFO L158 Benchmark]: Boogie Preprocessor took 27.14ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 99.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:00:30,863 INFO L158 Benchmark]: IcfgBuilder took 320.13ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 85.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:00:30,863 INFO L158 Benchmark]: TraceAbstraction took 56190.17ms. Allocated memory was 167.8MB in the beginning and 8.0GB in the end (delta: 7.9GB). Free memory was 83.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 5.7GB. Max. memory is 16.1GB. [2025-03-04 07:00:30,863 INFO L158 Benchmark]: Witness Printer took 119.96ms. Allocated memory is still 8.0GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 07:00:30,864 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.21ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.16ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 102.9MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.39ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 101.8MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.14ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 99.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 320.13ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 85.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 56190.17ms. Allocated memory was 167.8MB in the beginning and 8.0GB in the end (delta: 7.9GB). Free memory was 83.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 5.7GB. Max. memory is 16.1GB. * Witness Printer took 119.96ms. Allocated memory is still 8.0GB. Free memory was 2.2GB in the beginning and 2.2GB 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, 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.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.4s 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, 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.5s 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.0s 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, 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: 3.8s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, 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.0s 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, 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: 48.8s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 41.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 4564 SdHoareTripleChecker+Valid, 18.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4201 mSDsluCounter, 7210 SdHoareTripleChecker+Invalid, 16.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7077 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36275 IncrementalHoareTripleChecker+Invalid, 36350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 133 mSDtfsCounter, 36275 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.2s 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, 6.0s InterpolantComputationTime, 1730 NumberOfCodeBlocks, 1730 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1857 ConstructedInterpolants, 36 QuantifiedInterpolants, 12133 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-04 07:00:30,895 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)