./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index-race.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index-race.c -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 60a63611d1a313fa1b0c54852f63fd78a6ffa830367ff168c44ddad2e7016fd6 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:10:37,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:10:37,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:10:37,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:10:37,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:10:37,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:10:37,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:10:37,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:10:37,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:10:37,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:10:37,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:10:37,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:10:37,553 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:10:37,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:10:37,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:10:37,553 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:10:37,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:10:37,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:10:37,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:10:37,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:10:37,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:10:37,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:10:37,554 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:10:37,554 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:10:37,554 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:10:37,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:10:37,554 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:10:37,554 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:10:37,554 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:10:37,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:37,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:37,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:37,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:10:37,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:37,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:37,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:37,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:10:37,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:10:37,556 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:10:37,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:10:37,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:10:37,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:10:37,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:10:37,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:10:37,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:10:37,556 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 -> 60a63611d1a313fa1b0c54852f63fd78a6ffa830367ff168c44ddad2e7016fd6 [2025-04-29 11:10:37,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:10:37,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:10:37,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:10:37,808 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:10:37,808 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:10:37,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index-race.c [2025-04-29 11:10:39,115 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd92a18ae/0676801f0bfa4234acab732d13cac6fc/FLAGb01bc7c41 [2025-04-29 11:10:39,308 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:10:39,309 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index-race.c [2025-04-29 11:10:39,310 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:39,311 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:39,315 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd92a18ae/0676801f0bfa4234acab732d13cac6fc/FLAGb01bc7c41 [2025-04-29 11:10:41,166 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd92a18ae/0676801f0bfa4234acab732d13cac6fc [2025-04-29 11:10:41,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:10:41,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:10:41,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:41,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:10:41,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:10:41,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e3afdd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41, skipping insertion in model container [2025-04-29 11:10:41,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:10:41,338 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:41,346 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:10:41,373 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:41,385 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:10:41,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41 WrapperNode [2025-04-29 11:10:41,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:41,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:41,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:10:41,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:10:41,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,410 INFO L138 Inliner]: procedures = 11, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-04-29 11:10:41,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:41,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:10:41,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:10:41,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:10:41,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:10:41,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:10:41,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:10:41,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:10:41,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:41,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:41,473 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-04-29 11:10:41,475 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-04-29 11:10:41,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:10:41,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:10:41,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:10:41,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:10:41,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:10:41,490 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:10:41,490 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:10:41,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:10:41,491 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:10:41,556 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:10:41,558 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:10:41,736 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:10:41,737 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:10:41,744 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:10:41,747 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:10:41,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:41 BoogieIcfgContainer [2025-04-29 11:10:41,748 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:10:41,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:10:41,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:10:41,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:10:41,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:10:41" (1/3) ... [2025-04-29 11:10:41,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1857424e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:41, skipping insertion in model container [2025-04-29 11:10:41,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (2/3) ... [2025-04-29 11:10:41,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1857424e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:41, skipping insertion in model container [2025-04-29 11:10:41,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:41" (3/3) ... [2025-04-29 11:10:41,756 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race.c [2025-04-29 11:10:41,766 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:10:41,770 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-index-race.c that has 2 procedures, 93 locations, 94 edges, 1 initial locations, 2 loop locations, and 6 error locations. [2025-04-29 11:10:41,770 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:10:41,834 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:10:41,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 95 transitions, 197 flow [2025-04-29 11:10:41,909 INFO L116 PetriNetUnfolderBase]: 2/128 cut-off events. [2025-04-29 11:10:41,912 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:10:41,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 128 events. 2/128 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 230 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 62. Up to 3 conditions per place. [2025-04-29 11:10:41,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 95 transitions, 197 flow [2025-04-29 11:10:41,918 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 95 transitions, 197 flow [2025-04-29 11:10:41,923 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:10:41,931 INFO L340 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;@11e39c6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:10:41,931 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 11:10:41,939 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:10:41,939 INFO L116 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-04-29 11:10:41,939 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:41,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:41,940 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] [2025-04-29 11:10:41,940 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:10:41,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:41,945 INFO L85 PathProgramCache]: Analyzing trace with hash -17767897, now seen corresponding path program 1 times [2025-04-29 11:10:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:41,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649896357] [2025-04-29 11:10:41,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:41,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:42,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:10:42,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:10:42,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:42,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:42,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:42,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:42,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649896357] [2025-04-29 11:10:42,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649896357] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:42,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:42,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:42,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007668923] [2025-04-29 11:10:42,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:42,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:42,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:42,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:42,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:42,171 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 95 [2025-04-29 11:10:42,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 95 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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-04-29 11:10:42,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:42,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 95 [2025-04-29 11:10:42,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:42,227 INFO L116 PetriNetUnfolderBase]: 3/162 cut-off events. [2025-04-29 11:10:42,228 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:10:42,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 162 events. 3/162 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 332 event pairs, 2 based on Foata normal form. 1/145 useless extension candidates. Maximal degree in co-relation 102. Up to 15 conditions per place. [2025-04-29 11:10:42,233 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 8 selfloop transitions, 2 changer transitions 1/93 dead transitions. [2025-04-29 11:10:42,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 93 transitions, 213 flow [2025-04-29 11:10:42,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:42,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2025-04-29 11:10:42,246 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9157894736842105 [2025-04-29 11:10:42,247 INFO L175 Difference]: Start difference. First operand has 96 places, 95 transitions, 197 flow. Second operand 3 states and 261 transitions. [2025-04-29 11:10:42,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 93 transitions, 213 flow [2025-04-29 11:10:42,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 93 transitions, 213 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:42,257 INFO L231 Difference]: Finished difference. Result has 97 places, 92 transitions, 195 flow [2025-04-29 11:10:42,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=97, PETRI_TRANSITIONS=92} [2025-04-29 11:10:42,262 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 1 predicate places. [2025-04-29 11:10:42,262 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 92 transitions, 195 flow [2025-04-29 11:10:42,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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-04-29 11:10:42,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:42,262 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] [2025-04-29 11:10:42,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:10:42,263 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:10:42,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:42,263 INFO L85 PathProgramCache]: Analyzing trace with hash -543497426, now seen corresponding path program 1 times [2025-04-29 11:10:42,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:42,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22231121] [2025-04-29 11:10:42,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:42,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:42,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:10:42,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:10:42,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:42,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:42,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:42,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22231121] [2025-04-29 11:10:42,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22231121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:42,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:42,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:42,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023288540] [2025-04-29 11:10:42,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:42,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:42,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:42,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:42,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:42,366 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 95 [2025-04-29 11:10:42,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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-04-29 11:10:42,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:42,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 95 [2025-04-29 11:10:42,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:42,401 INFO L116 PetriNetUnfolderBase]: 5/170 cut-off events. [2025-04-29 11:10:42,402 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:10:42,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 170 events. 5/170 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 343 event pairs, 2 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 165. Up to 16 conditions per place. [2025-04-29 11:10:42,402 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 7 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2025-04-29 11:10:42,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 213 flow [2025-04-29 11:10:42,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:42,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-04-29 11:10:42,404 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-04-29 11:10:42,404 INFO L175 Difference]: Start difference. First operand has 97 places, 92 transitions, 195 flow. Second operand 3 states and 266 transitions. [2025-04-29 11:10:42,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 213 flow [2025-04-29 11:10:42,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:10:42,407 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 201 flow [2025-04-29 11:10:42,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2025-04-29 11:10:42,407 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2025-04-29 11:10:42,407 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 201 flow [2025-04-29 11:10:42,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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-04-29 11:10:42,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:42,408 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] [2025-04-29 11:10:42,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:10:42,408 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:10:42,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:42,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1323301631, now seen corresponding path program 1 times [2025-04-29 11:10:42,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:42,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684761278] [2025-04-29 11:10:42,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:42,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:42,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:10:42,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:10:42,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:42,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:42,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:42,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684761278] [2025-04-29 11:10:42,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684761278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:42,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:42,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:42,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854838426] [2025-04-29 11:10:42,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:42,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:10:42,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:42,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:10:42,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:10:42,670 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 95 [2025-04-29 11:10:42,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 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-04-29 11:10:42,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:42,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 95 [2025-04-29 11:10:42,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:42,712 INFO L116 PetriNetUnfolderBase]: 2/148 cut-off events. [2025-04-29 11:10:42,713 INFO L117 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2025-04-29 11:10:42,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 148 events. 2/148 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 232 event pairs, 0 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 87. Up to 16 conditions per place. [2025-04-29 11:10:42,714 INFO L140 encePairwiseOnDemand]: 87/95 looper letters, 11 selfloop transitions, 2 changer transitions 5/97 dead transitions. [2025-04-29 11:10:42,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 247 flow [2025-04-29 11:10:42,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 505 transitions. [2025-04-29 11:10:42,716 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8859649122807017 [2025-04-29 11:10:42,716 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 201 flow. Second operand 6 states and 505 transitions. [2025-04-29 11:10:42,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 247 flow [2025-04-29 11:10:42,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 97 transitions, 247 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:42,719 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 219 flow [2025-04-29 11:10:42,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2025-04-29 11:10:42,720 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 8 predicate places. [2025-04-29 11:10:42,720 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 219 flow [2025-04-29 11:10:42,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 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-04-29 11:10:42,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:42,721 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] [2025-04-29 11:10:42,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:10:42,721 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:10:42,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:42,721 INFO L85 PathProgramCache]: Analyzing trace with hash -505380817, now seen corresponding path program 1 times [2025-04-29 11:10:42,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:42,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905194052] [2025-04-29 11:10:42,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:42,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:42,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:10:42,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:10:42,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:42,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:43,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:43,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905194052] [2025-04-29 11:10:43,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905194052] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:43,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:43,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:43,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604667793] [2025-04-29 11:10:43,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:43,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:43,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:43,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:43,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:43,214 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 95 [2025-04-29 11:10:43,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:43,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:43,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 95 [2025-04-29 11:10:43,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:43,321 INFO L116 PetriNetUnfolderBase]: 71/371 cut-off events. [2025-04-29 11:10:43,322 INFO L117 PetriNetUnfolderBase]: For 26/29 co-relation queries the response was YES. [2025-04-29 11:10:43,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 371 events. 71/371 cut-off events. For 26/29 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1800 event pairs, 35 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 531. Up to 151 conditions per place. [2025-04-29 11:10:43,324 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 23 selfloop transitions, 22 changer transitions 0/113 dead transitions. [2025-04-29 11:10:43,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 113 transitions, 351 flow [2025-04-29 11:10:43,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 466 transitions. [2025-04-29 11:10:43,327 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8175438596491228 [2025-04-29 11:10:43,327 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 219 flow. Second operand 6 states and 466 transitions. [2025-04-29 11:10:43,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 113 transitions, 351 flow [2025-04-29 11:10:43,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 113 transitions, 337 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-29 11:10:43,331 INFO L231 Difference]: Finished difference. Result has 106 places, 113 transitions, 355 flow [2025-04-29 11:10:43,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=106, PETRI_TRANSITIONS=113} [2025-04-29 11:10:43,332 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 10 predicate places. [2025-04-29 11:10:43,333 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 113 transitions, 355 flow [2025-04-29 11:10:43,333 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:43,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:43,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:43,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:10:43,333 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:10:43,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:43,334 INFO L85 PathProgramCache]: Analyzing trace with hash 15846870, now seen corresponding path program 1 times [2025-04-29 11:10:43,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:43,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997699182] [2025-04-29 11:10:43,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:43,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:43,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:10:43,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:10:43,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:43,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:43,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:43,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997699182] [2025-04-29 11:10:43,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997699182] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:43,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:43,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:43,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274013978] [2025-04-29 11:10:43,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:43,616 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:43,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:43,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:43,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:43,684 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 95 [2025-04-29 11:10:43,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 113 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 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-04-29 11:10:43,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:43,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 95 [2025-04-29 11:10:43,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:43,822 INFO L116 PetriNetUnfolderBase]: 139/525 cut-off events. [2025-04-29 11:10:43,822 INFO L117 PetriNetUnfolderBase]: For 146/148 co-relation queries the response was YES. [2025-04-29 11:10:43,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 525 events. 139/525 cut-off events. For 146/148 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2733 event pairs, 31 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 1058. Up to 257 conditions per place. [2025-04-29 11:10:43,828 INFO L140 encePairwiseOnDemand]: 80/95 looper letters, 36 selfloop transitions, 48 changer transitions 12/156 dead transitions. [2025-04-29 11:10:43,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 156 transitions, 679 flow [2025-04-29 11:10:43,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 492 transitions. [2025-04-29 11:10:43,830 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8631578947368421 [2025-04-29 11:10:43,830 INFO L175 Difference]: Start difference. First operand has 106 places, 113 transitions, 355 flow. Second operand 6 states and 492 transitions. [2025-04-29 11:10:43,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 156 transitions, 679 flow [2025-04-29 11:10:43,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 156 transitions, 679 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:43,839 INFO L231 Difference]: Finished difference. Result has 116 places, 144 transitions, 712 flow [2025-04-29 11:10:43,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=712, PETRI_PLACES=116, PETRI_TRANSITIONS=144} [2025-04-29 11:10:43,841 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 20 predicate places. [2025-04-29 11:10:43,841 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 144 transitions, 712 flow [2025-04-29 11:10:43,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 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-04-29 11:10:43,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:43,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:43,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:10:43,843 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:10:43,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:43,844 INFO L85 PathProgramCache]: Analyzing trace with hash 419170691, now seen corresponding path program 1 times [2025-04-29 11:10:43,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:43,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321241508] [2025-04-29 11:10:43,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:43,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:43,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:10:43,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:10:43,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:43,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:44,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:44,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321241508] [2025-04-29 11:10:44,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321241508] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:44,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:44,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:44,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094966443] [2025-04-29 11:10:44,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:44,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:44,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:44,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:44,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:44,224 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 95 [2025-04-29 11:10:44,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 144 transitions, 712 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 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-04-29 11:10:44,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:44,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 95 [2025-04-29 11:10:44,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:44,332 INFO L116 PetriNetUnfolderBase]: 142/515 cut-off events. [2025-04-29 11:10:44,333 INFO L117 PetriNetUnfolderBase]: For 440/446 co-relation queries the response was YES. [2025-04-29 11:10:44,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1587 conditions, 515 events. 142/515 cut-off events. For 440/446 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2839 event pairs, 10 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 1507. Up to 241 conditions per place. [2025-04-29 11:10:44,336 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 73 selfloop transitions, 25 changer transitions 13/172 dead transitions. [2025-04-29 11:10:44,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 172 transitions, 1095 flow [2025-04-29 11:10:44,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 475 transitions. [2025-04-29 11:10:44,338 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-04-29 11:10:44,338 INFO L175 Difference]: Start difference. First operand has 116 places, 144 transitions, 712 flow. Second operand 6 states and 475 transitions. [2025-04-29 11:10:44,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 172 transitions, 1095 flow [2025-04-29 11:10:44,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 172 transitions, 1076 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-29 11:10:44,349 INFO L231 Difference]: Finished difference. Result has 115 places, 159 transitions, 928 flow [2025-04-29 11:10:44,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=928, PETRI_PLACES=115, PETRI_TRANSITIONS=159} [2025-04-29 11:10:44,350 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 19 predicate places. [2025-04-29 11:10:44,351 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 159 transitions, 928 flow [2025-04-29 11:10:44,351 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 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-04-29 11:10:44,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:44,351 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] [2025-04-29 11:10:44,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:10:44,352 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:10:44,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash -745191254, now seen corresponding path program 1 times [2025-04-29 11:10:44,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:44,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273184737] [2025-04-29 11:10:44,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:44,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:44,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:10:44,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:10:44,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:44,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:10:44,379 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:10:44,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:10:44,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:10:44,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:44,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:10:44,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:10:44,409 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:10:44,410 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-29 11:10:44,411 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-04-29 11:10:44,411 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-04-29 11:10:44,412 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-04-29 11:10:44,412 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-04-29 11:10:44,412 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-04-29 11:10:44,412 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-04-29 11:10:44,412 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-04-29 11:10:44,412 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-04-29 11:10:44,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:10:44,412 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:44,416 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:10:44,416 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-29 11:10:44,431 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-29 11:10:44,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 117 transitions, 250 flow [2025-04-29 11:10:44,449 INFO L116 PetriNetUnfolderBase]: 4/218 cut-off events. [2025-04-29 11:10:44,450 INFO L117 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-04-29 11:10:44,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 218 events. 4/218 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 494 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 130. Up to 6 conditions per place. [2025-04-29 11:10:44,450 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 117 transitions, 250 flow [2025-04-29 11:10:44,451 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 117 transitions, 250 flow [2025-04-29 11:10:44,452 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:10:44,452 INFO L340 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;@11e39c6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:10:44,452 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-29 11:10:44,454 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:10:44,454 INFO L116 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-04-29 11:10:44,454 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:44,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:44,454 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] [2025-04-29 11:10:44,455 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:44,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1997081156, now seen corresponding path program 1 times [2025-04-29 11:10:44,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:44,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026355578] [2025-04-29 11:10:44,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:44,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:10:44,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:10:44,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:44,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:44,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:44,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026355578] [2025-04-29 11:10:44,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026355578] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:44,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:44,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:44,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735667431] [2025-04-29 11:10:44,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:44,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:44,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:44,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:44,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:44,485 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 117 [2025-04-29 11:10:44,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 117 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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-04-29 11:10:44,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:44,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 117 [2025-04-29 11:10:44,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:44,535 INFO L116 PetriNetUnfolderBase]: 19/443 cut-off events. [2025-04-29 11:10:44,535 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-29 11:10:44,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 443 events. 19/443 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1853 event pairs, 16 based on Foata normal form. 1/390 useless extension candidates. Maximal degree in co-relation 289. Up to 50 conditions per place. [2025-04-29 11:10:44,538 INFO L140 encePairwiseOnDemand]: 113/117 looper letters, 11 selfloop transitions, 2 changer transitions 1/115 dead transitions. [2025-04-29 11:10:44,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 115 transitions, 272 flow [2025-04-29 11:10:44,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2025-04-29 11:10:44,541 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2025-04-29 11:10:44,541 INFO L175 Difference]: Start difference. First operand has 119 places, 117 transitions, 250 flow. Second operand 3 states and 321 transitions. [2025-04-29 11:10:44,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 115 transitions, 272 flow [2025-04-29 11:10:44,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 115 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:44,543 INFO L231 Difference]: Finished difference. Result has 120 places, 114 transitions, 248 flow [2025-04-29 11:10:44,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=120, PETRI_TRANSITIONS=114} [2025-04-29 11:10:44,545 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 1 predicate places. [2025-04-29 11:10:44,545 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 114 transitions, 248 flow [2025-04-29 11:10:44,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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-04-29 11:10:44,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:44,546 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] [2025-04-29 11:10:44,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:10:44,546 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:44,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:44,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1974559794, now seen corresponding path program 1 times [2025-04-29 11:10:44,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:44,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308427485] [2025-04-29 11:10:44,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:44,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:44,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:10:44,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:10:44,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:44,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:44,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:44,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308427485] [2025-04-29 11:10:44,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308427485] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:44,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:44,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:44,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689344698] [2025-04-29 11:10:44,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:44,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:44,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:44,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:44,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:44,580 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 117 [2025-04-29 11:10:44,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 114 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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-04-29 11:10:44,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:44,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 117 [2025-04-29 11:10:44,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:44,630 INFO L116 PetriNetUnfolderBase]: 48/635 cut-off events. [2025-04-29 11:10:44,630 INFO L117 PetriNetUnfolderBase]: For 45/50 co-relation queries the response was YES. [2025-04-29 11:10:44,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 635 events. 48/635 cut-off events. For 45/50 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3257 event pairs, 28 based on Foata normal form. 0/577 useless extension candidates. Maximal degree in co-relation 729. Up to 97 conditions per place. [2025-04-29 11:10:44,633 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 12 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2025-04-29 11:10:44,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 115 transitions, 285 flow [2025-04-29 11:10:44,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-04-29 11:10:44,634 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-04-29 11:10:44,635 INFO L175 Difference]: Start difference. First operand has 120 places, 114 transitions, 248 flow. Second operand 3 states and 324 transitions. [2025-04-29 11:10:44,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 115 transitions, 285 flow [2025-04-29 11:10:44,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:10:44,636 INFO L231 Difference]: Finished difference. Result has 117 places, 114 transitions, 259 flow [2025-04-29 11:10:44,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=117, PETRI_TRANSITIONS=114} [2025-04-29 11:10:44,637 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -2 predicate places. [2025-04-29 11:10:44,637 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 114 transitions, 259 flow [2025-04-29 11:10:44,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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-04-29 11:10:44,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:44,638 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] [2025-04-29 11:10:44,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:10:44,639 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:44,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:44,640 INFO L85 PathProgramCache]: Analyzing trace with hash 461904447, now seen corresponding path program 1 times [2025-04-29 11:10:44,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:44,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641819] [2025-04-29 11:10:44,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:44,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:44,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:10:44,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:10:44,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:44,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:44,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:44,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641819] [2025-04-29 11:10:44,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641819] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:44,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:44,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:44,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017251568] [2025-04-29 11:10:44,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:44,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:10:44,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:44,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:10:44,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:10:44,756 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 117 [2025-04-29 11:10:44,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 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-04-29 11:10:44,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:44,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 117 [2025-04-29 11:10:44,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:44,804 INFO L116 PetriNetUnfolderBase]: 12/351 cut-off events. [2025-04-29 11:10:44,804 INFO L117 PetriNetUnfolderBase]: For 30/57 co-relation queries the response was YES. [2025-04-29 11:10:44,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 351 events. 12/351 cut-off events. For 30/57 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1189 event pairs, 2 based on Foata normal form. 2/333 useless extension candidates. Maximal degree in co-relation 228. Up to 39 conditions per place. [2025-04-29 11:10:44,806 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 14 selfloop transitions, 2 changer transitions 5/120 dead transitions. [2025-04-29 11:10:44,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 313 flow [2025-04-29 11:10:44,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2025-04-29 11:10:44,808 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8945868945868946 [2025-04-29 11:10:44,808 INFO L175 Difference]: Start difference. First operand has 117 places, 114 transitions, 259 flow. Second operand 6 states and 628 transitions. [2025-04-29 11:10:44,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 313 flow [2025-04-29 11:10:44,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 120 transitions, 313 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:44,809 INFO L231 Difference]: Finished difference. Result has 126 places, 115 transitions, 281 flow [2025-04-29 11:10:44,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=126, PETRI_TRANSITIONS=115} [2025-04-29 11:10:44,810 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 7 predicate places. [2025-04-29 11:10:44,810 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 115 transitions, 281 flow [2025-04-29 11:10:44,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 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-04-29 11:10:44,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:44,811 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] [2025-04-29 11:10:44,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:10:44,811 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:44,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:44,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1366778001, now seen corresponding path program 1 times [2025-04-29 11:10:44,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:44,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995015546] [2025-04-29 11:10:44,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:44,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:44,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:10:44,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:10:44,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:44,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:44,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:44,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995015546] [2025-04-29 11:10:44,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995015546] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:44,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:44,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:44,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616032545] [2025-04-29 11:10:44,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:44,982 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:44,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:44,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:44,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:45,115 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 117 [2025-04-29 11:10:45,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 115 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 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-04-29 11:10:45,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:45,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 117 [2025-04-29 11:10:45,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:45,461 INFO L116 PetriNetUnfolderBase]: 1008/3084 cut-off events. [2025-04-29 11:10:45,461 INFO L117 PetriNetUnfolderBase]: For 205/209 co-relation queries the response was YES. [2025-04-29 11:10:45,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5139 conditions, 3084 events. 1008/3084 cut-off events. For 205/209 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 25020 event pairs, 569 based on Foata normal form. 0/2797 useless extension candidates. Maximal degree in co-relation 4551. Up to 1573 conditions per place. [2025-04-29 11:10:45,488 INFO L140 encePairwiseOnDemand]: 102/117 looper letters, 31 selfloop transitions, 38 changer transitions 0/153 dead transitions. [2025-04-29 11:10:45,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 153 transitions, 500 flow [2025-04-29 11:10:45,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2025-04-29 11:10:45,491 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-04-29 11:10:45,491 INFO L175 Difference]: Start difference. First operand has 126 places, 115 transitions, 281 flow. Second operand 6 states and 585 transitions. [2025-04-29 11:10:45,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 153 transitions, 500 flow [2025-04-29 11:10:45,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 153 transitions, 488 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:10:45,496 INFO L231 Difference]: Finished difference. Result has 129 places, 152 transitions, 523 flow [2025-04-29 11:10:45,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=523, PETRI_PLACES=129, PETRI_TRANSITIONS=152} [2025-04-29 11:10:45,497 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2025-04-29 11:10:45,497 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 152 transitions, 523 flow [2025-04-29 11:10:45,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 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-04-29 11:10:45,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:45,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:45,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:10:45,498 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:45,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:45,499 INFO L85 PathProgramCache]: Analyzing trace with hash 524894655, now seen corresponding path program 1 times [2025-04-29 11:10:45,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:45,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115762181] [2025-04-29 11:10:45,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:45,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:45,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:10:45,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:10:45,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:45,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:45,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:45,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115762181] [2025-04-29 11:10:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115762181] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:45,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:45,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:45,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170363826] [2025-04-29 11:10:45,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:45,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:45,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:45,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:45,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:45,790 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2025-04-29 11:10:45,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 152 transitions, 523 flow. Second operand has 6 states, 6 states have (on average 90.5) internal successors, (543), 6 states have internal predecessors, (543), 0 states have call successors, (0), 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-04-29 11:10:45,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:45,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2025-04-29 11:10:45,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:46,460 INFO L116 PetriNetUnfolderBase]: 2559/7192 cut-off events. [2025-04-29 11:10:46,460 INFO L117 PetriNetUnfolderBase]: For 1961/2594 co-relation queries the response was YES. [2025-04-29 11:10:46,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15571 conditions, 7192 events. 2559/7192 cut-off events. For 1961/2594 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 66138 event pairs, 642 based on Foata normal form. 22/6614 useless extension candidates. Maximal degree in co-relation 13078. Up to 3099 conditions per place. [2025-04-29 11:10:46,494 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 87 selfloop transitions, 86 changer transitions 0/262 dead transitions. [2025-04-29 11:10:46,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 262 transitions, 1353 flow [2025-04-29 11:10:46,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 630 transitions. [2025-04-29 11:10:46,496 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2025-04-29 11:10:46,496 INFO L175 Difference]: Start difference. First operand has 129 places, 152 transitions, 523 flow. Second operand 6 states and 630 transitions. [2025-04-29 11:10:46,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 262 transitions, 1353 flow [2025-04-29 11:10:46,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 262 transitions, 1353 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:46,504 INFO L231 Difference]: Finished difference. Result has 138 places, 235 transitions, 1249 flow [2025-04-29 11:10:46,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1249, PETRI_PLACES=138, PETRI_TRANSITIONS=235} [2025-04-29 11:10:46,505 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2025-04-29 11:10:46,505 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 235 transitions, 1249 flow [2025-04-29 11:10:46,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.5) internal successors, (543), 6 states have internal predecessors, (543), 0 states have call successors, (0), 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-04-29 11:10:46,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:46,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:46,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:10:46,506 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:46,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash -12175924, now seen corresponding path program 1 times [2025-04-29 11:10:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:46,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784116497] [2025-04-29 11:10:46,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:46,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:46,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:10:46,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:10:46,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:46,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:46,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:46,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784116497] [2025-04-29 11:10:46,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784116497] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:46,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:46,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:46,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341053297] [2025-04-29 11:10:46,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:46,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:46,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:46,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:46,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:46,811 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2025-04-29 11:10:46,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 235 transitions, 1249 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 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-04-29 11:10:46,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:46,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2025-04-29 11:10:46,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:47,729 INFO L116 PetriNetUnfolderBase]: 3068/8899 cut-off events. [2025-04-29 11:10:47,730 INFO L117 PetriNetUnfolderBase]: For 7037/7419 co-relation queries the response was YES. [2025-04-29 11:10:47,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24689 conditions, 8899 events. 3068/8899 cut-off events. For 7037/7419 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 88484 event pairs, 520 based on Foata normal form. 30/8348 useless extension candidates. Maximal degree in co-relation 23695. Up to 4189 conditions per place. [2025-04-29 11:10:47,789 INFO L140 encePairwiseOnDemand]: 102/117 looper letters, 135 selfloop transitions, 71 changer transitions 0/303 dead transitions. [2025-04-29 11:10:47,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 303 transitions, 2105 flow [2025-04-29 11:10:47,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 596 transitions. [2025-04-29 11:10:47,791 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8490028490028491 [2025-04-29 11:10:47,791 INFO L175 Difference]: Start difference. First operand has 138 places, 235 transitions, 1249 flow. Second operand 6 states and 596 transitions. [2025-04-29 11:10:47,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 303 transitions, 2105 flow [2025-04-29 11:10:47,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 303 transitions, 2087 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:47,822 INFO L231 Difference]: Finished difference. Result has 148 places, 301 transitions, 2011 flow [2025-04-29 11:10:47,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2011, PETRI_PLACES=148, PETRI_TRANSITIONS=301} [2025-04-29 11:10:47,823 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 29 predicate places. [2025-04-29 11:10:47,824 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 301 transitions, 2011 flow [2025-04-29 11:10:47,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 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-04-29 11:10:47,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:47,825 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-29 11:10:47,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:10:47,825 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:47,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:47,825 INFO L85 PathProgramCache]: Analyzing trace with hash -547117353, now seen corresponding path program 1 times [2025-04-29 11:10:47,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:47,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148387381] [2025-04-29 11:10:47,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:47,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-29 11:10:47,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-29 11:10:47,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:47,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:48,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148387381] [2025-04-29 11:10:48,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148387381] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:48,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:48,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:10:48,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064949354] [2025-04-29 11:10:48,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:48,136 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:10:48,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:48,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:10:48,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:10:48,456 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 117 [2025-04-29 11:10:48,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 301 transitions, 2011 flow. Second operand has 11 states, 11 states have (on average 80.18181818181819) internal successors, (882), 11 states have internal predecessors, (882), 0 states have call successors, (0), 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-04-29 11:10:48,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:48,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 117 [2025-04-29 11:10:48,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:49,475 INFO L116 PetriNetUnfolderBase]: 3381/9647 cut-off events. [2025-04-29 11:10:49,476 INFO L117 PetriNetUnfolderBase]: For 13377/14034 co-relation queries the response was YES. [2025-04-29 11:10:49,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30617 conditions, 9647 events. 3381/9647 cut-off events. For 13377/14034 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 96593 event pairs, 480 based on Foata normal form. 149/9224 useless extension candidates. Maximal degree in co-relation 29344. Up to 3013 conditions per place. [2025-04-29 11:10:49,536 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 310 selfloop transitions, 36 changer transitions 0/432 dead transitions. [2025-04-29 11:10:49,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 432 transitions, 3905 flow [2025-04-29 11:10:49,537 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:10:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:10:49,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1100 transitions. [2025-04-29 11:10:49,539 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7232084155161078 [2025-04-29 11:10:49,539 INFO L175 Difference]: Start difference. First operand has 148 places, 301 transitions, 2011 flow. Second operand 13 states and 1100 transitions. [2025-04-29 11:10:49,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 432 transitions, 3905 flow [2025-04-29 11:10:49,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 432 transitions, 3765 flow, removed 70 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:49,576 INFO L231 Difference]: Finished difference. Result has 159 places, 300 transitions, 1939 flow [2025-04-29 11:10:49,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1939, PETRI_PLACES=159, PETRI_TRANSITIONS=300} [2025-04-29 11:10:49,577 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 40 predicate places. [2025-04-29 11:10:49,577 INFO L485 AbstractCegarLoop]: Abstraction has has 159 places, 300 transitions, 1939 flow [2025-04-29 11:10:49,578 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 80.18181818181819) internal successors, (882), 11 states have internal predecessors, (882), 0 states have call successors, (0), 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-04-29 11:10:49,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:49,578 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-29 11:10:49,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:10:49,578 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:49,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:49,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1592469179, now seen corresponding path program 1 times [2025-04-29 11:10:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:49,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282212699] [2025-04-29 11:10:49,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:49,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:49,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-29 11:10:49,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-29 11:10:49,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:49,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:49,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:49,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282212699] [2025-04-29 11:10:49,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282212699] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:49,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:49,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:10:49,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229598619] [2025-04-29 11:10:49,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:49,924 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:10:49,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:49,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:10:49,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:10:50,339 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 117 [2025-04-29 11:10:50,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 300 transitions, 1939 flow. Second operand has 11 states, 11 states have (on average 81.0) internal successors, (891), 11 states have internal predecessors, (891), 0 states have call successors, (0), 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-04-29 11:10:50,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:50,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 117 [2025-04-29 11:10:50,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:52,045 INFO L116 PetriNetUnfolderBase]: 5302/13431 cut-off events. [2025-04-29 11:10:52,046 INFO L117 PetriNetUnfolderBase]: For 19020/22309 co-relation queries the response was YES. [2025-04-29 11:10:52,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45104 conditions, 13431 events. 5302/13431 cut-off events. For 19020/22309 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 132305 event pairs, 730 based on Foata normal form. 397/13257 useless extension candidates. Maximal degree in co-relation 41094. Up to 3237 conditions per place. [2025-04-29 11:10:52,119 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 342 selfloop transitions, 262 changer transitions 6/691 dead transitions. [2025-04-29 11:10:52,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 691 transitions, 6043 flow [2025-04-29 11:10:52,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:10:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-29 11:10:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1614 transitions. [2025-04-29 11:10:52,123 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7663817663817664 [2025-04-29 11:10:52,123 INFO L175 Difference]: Start difference. First operand has 159 places, 300 transitions, 1939 flow. Second operand 18 states and 1614 transitions. [2025-04-29 11:10:52,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 691 transitions, 6043 flow [2025-04-29 11:10:52,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 691 transitions, 5899 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-04-29 11:10:52,181 INFO L231 Difference]: Finished difference. Result has 174 places, 506 transitions, 4575 flow [2025-04-29 11:10:52,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4575, PETRI_PLACES=174, PETRI_TRANSITIONS=506} [2025-04-29 11:10:52,182 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 55 predicate places. [2025-04-29 11:10:52,182 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 506 transitions, 4575 flow [2025-04-29 11:10:52,183 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.0) internal successors, (891), 11 states have internal predecessors, (891), 0 states have call successors, (0), 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-04-29 11:10:52,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:52,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:52,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:10:52,183 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:52,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:52,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1096609523, now seen corresponding path program 1 times [2025-04-29 11:10:52,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:52,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232400222] [2025-04-29 11:10:52,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:52,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:52,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-29 11:10:52,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-29 11:10:52,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:52,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:52,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:52,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232400222] [2025-04-29 11:10:52,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232400222] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:52,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:52,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:10:52,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132679983] [2025-04-29 11:10:52,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:52,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:10:52,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:52,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:10:52,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:10:52,845 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 117 [2025-04-29 11:10:52,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 506 transitions, 4575 flow. Second operand has 11 states, 11 states have (on average 81.81818181818181) internal successors, (900), 11 states have internal predecessors, (900), 0 states have call successors, (0), 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-04-29 11:10:52,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:52,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 117 [2025-04-29 11:10:52,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:54,300 INFO L116 PetriNetUnfolderBase]: 4488/12064 cut-off events. [2025-04-29 11:10:54,300 INFO L117 PetriNetUnfolderBase]: For 34561/35570 co-relation queries the response was YES. [2025-04-29 11:10:54,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48061 conditions, 12064 events. 4488/12064 cut-off events. For 34561/35570 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 121409 event pairs, 443 based on Foata normal form. 264/11750 useless extension candidates. Maximal degree in co-relation 46682. Up to 3243 conditions per place. [2025-04-29 11:10:54,363 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 495 selfloop transitions, 44 changer transitions 0/658 dead transitions. [2025-04-29 11:10:54,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 658 transitions, 7538 flow [2025-04-29 11:10:54,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:10:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:10:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1124 transitions. [2025-04-29 11:10:54,366 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7389875082182774 [2025-04-29 11:10:54,366 INFO L175 Difference]: Start difference. First operand has 174 places, 506 transitions, 4575 flow. Second operand 13 states and 1124 transitions. [2025-04-29 11:10:54,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 658 transitions, 7538 flow [2025-04-29 11:10:54,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 658 transitions, 7460 flow, removed 34 selfloop flow, removed 5 redundant places. [2025-04-29 11:10:54,483 INFO L231 Difference]: Finished difference. Result has 180 places, 505 transitions, 4589 flow [2025-04-29 11:10:54,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=4501, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4589, PETRI_PLACES=180, PETRI_TRANSITIONS=505} [2025-04-29 11:10:54,484 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 61 predicate places. [2025-04-29 11:10:54,484 INFO L485 AbstractCegarLoop]: Abstraction has has 180 places, 505 transitions, 4589 flow [2025-04-29 11:10:54,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.81818181818181) internal successors, (900), 11 states have internal predecessors, (900), 0 states have call successors, (0), 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-04-29 11:10:54,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:54,485 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:54,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:10:54,485 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:54,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:54,485 INFO L85 PathProgramCache]: Analyzing trace with hash 312563283, now seen corresponding path program 1 times [2025-04-29 11:10:54,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:54,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312609849] [2025-04-29 11:10:54,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:54,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:54,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-29 11:10:54,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-29 11:10:54,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:54,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:10:54,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:54,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312609849] [2025-04-29 11:10:54,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312609849] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:54,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:54,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:54,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850675137] [2025-04-29 11:10:54,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:54,651 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:54,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:54,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:54,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:54,731 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2025-04-29 11:10:54,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 505 transitions, 4589 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 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-04-29 11:10:54,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:54,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2025-04-29 11:10:54,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:55,594 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([349] L22-6-->L22-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread2of2ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread2of2ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread2of2ForFork0_#t~nondet1=|v_threadThread2of2ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, ~datas~0.offset=v_~datas~0.offset_5, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_9} OutVars{#race=|v_#race_21|, threadThread2of2ForFork0_#t~nondet1=|v_threadThread2of2ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, ~datas~0.offset=v_~datas~0.offset_5, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_9} AuxVars[] AssignedVars[#race][333], [30#L43-1true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 161#true, Black: 199#true, Black: 219#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 154#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 131#(= |ULTIMATE.start_main_~i~1#1| 0), 86#L22-11true, 91#L22-7true, 118#true, Black: 156#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 265#(= |threadThread2of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), Black: 143#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 206#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 125#true, Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 225#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 205#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 204#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), Black: 207#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 120#true, Black: 209#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 144#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 151#true, Black: 223#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 153#(= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 142#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 163#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 208#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 140#true, 241#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), Black: 155#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 221#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 127#(= |#race~datas~0| 0)]) [2025-04-29 11:10:55,595 INFO L286 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2025-04-29 11:10:55,595 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-29 11:10:55,595 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-29 11:10:55,595 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-29 11:10:57,632 INFO L116 PetriNetUnfolderBase]: 9972/22493 cut-off events. [2025-04-29 11:10:57,632 INFO L117 PetriNetUnfolderBase]: For 76633/77803 co-relation queries the response was YES. [2025-04-29 11:10:57,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91950 conditions, 22493 events. 9972/22493 cut-off events. For 76633/77803 co-relation queries the response was YES. Maximal size of possible extension queue 1305. Compared 228818 event pairs, 1238 based on Foata normal form. 11/21312 useless extension candidates. Maximal degree in co-relation 89859. Up to 11550 conditions per place. [2025-04-29 11:10:57,798 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 363 selfloop transitions, 352 changer transitions 15/862 dead transitions. [2025-04-29 11:10:57,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 862 transitions, 9423 flow [2025-04-29 11:10:57,799 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2025-04-29 11:10:57,800 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8917378917378918 [2025-04-29 11:10:57,800 INFO L175 Difference]: Start difference. First operand has 180 places, 505 transitions, 4589 flow. Second operand 6 states and 626 transitions. [2025-04-29 11:10:57,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 862 transitions, 9423 flow [2025-04-29 11:10:58,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 862 transitions, 9187 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-04-29 11:10:58,116 INFO L231 Difference]: Finished difference. Result has 177 places, 777 transitions, 8304 flow [2025-04-29 11:10:58,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=4501, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8304, PETRI_PLACES=177, PETRI_TRANSITIONS=777} [2025-04-29 11:10:58,119 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 58 predicate places. [2025-04-29 11:10:58,119 INFO L485 AbstractCegarLoop]: Abstraction has has 177 places, 777 transitions, 8304 flow [2025-04-29 11:10:58,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 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-04-29 11:10:58,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:58,120 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, 1, 1] [2025-04-29 11:10:58,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:10:58,120 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:58,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1787279990, now seen corresponding path program 1 times [2025-04-29 11:10:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:58,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886304997] [2025-04-29 11:10:58,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:58,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:58,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 11:10:58,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 11:10:58,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:58,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:10:58,138 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:10:58,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 11:10:58,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 11:10:58,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:58,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:10:58,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:10:58,153 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:10:58,154 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-04-29 11:10:58,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-04-29 11:10:58,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-04-29 11:10:58,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-04-29 11:10:58,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-04-29 11:10:58,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-04-29 11:10:58,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-04-29 11:10:58,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-04-29 11:10:58,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-04-29 11:10:58,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-04-29 11:10:58,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-04-29 11:10:58,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:10:58,155 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:58,155 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:10:58,155 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-29 11:10:58,168 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-29 11:10:58,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 139 transitions, 305 flow [2025-04-29 11:10:58,190 INFO L116 PetriNetUnfolderBase]: 9/359 cut-off events. [2025-04-29 11:10:58,190 INFO L117 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-04-29 11:10:58,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 359 events. 9/359 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1037 event pairs, 1 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 226. Up to 12 conditions per place. [2025-04-29 11:10:58,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 139 transitions, 305 flow [2025-04-29 11:10:58,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 139 transitions, 305 flow [2025-04-29 11:10:58,192 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:10:58,193 INFO L340 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;@11e39c6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:10:58,193 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-29 11:10:58,194 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:10:58,194 INFO L116 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-04-29 11:10:58,194 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:58,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:58,194 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] [2025-04-29 11:10:58,194 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:10:58,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:58,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1414759207, now seen corresponding path program 1 times [2025-04-29 11:10:58,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:58,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170791198] [2025-04-29 11:10:58,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:58,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:58,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:10:58,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:10:58,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:58,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:58,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:58,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170791198] [2025-04-29 11:10:58,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170791198] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:58,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:58,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:58,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313126636] [2025-04-29 11:10:58,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:58,205 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:58,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:58,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:58,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:58,223 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 139 [2025-04-29 11:10:58,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 139 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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-04-29 11:10:58,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:58,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 139 [2025-04-29 11:10:58,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:58,312 INFO L116 PetriNetUnfolderBase]: 90/1263 cut-off events. [2025-04-29 11:10:58,312 INFO L117 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-04-29 11:10:58,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 1263 events. 90/1263 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8367 event pairs, 81 based on Foata normal form. 1/1104 useless extension candidates. Maximal degree in co-relation 880. Up to 178 conditions per place. [2025-04-29 11:10:58,318 INFO L140 encePairwiseOnDemand]: 135/139 looper letters, 14 selfloop transitions, 2 changer transitions 1/137 dead transitions. [2025-04-29 11:10:58,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 333 flow [2025-04-29 11:10:58,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:58,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2025-04-29 11:10:58,319 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9136690647482014 [2025-04-29 11:10:58,319 INFO L175 Difference]: Start difference. First operand has 142 places, 139 transitions, 305 flow. Second operand 3 states and 381 transitions. [2025-04-29 11:10:58,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 333 flow [2025-04-29 11:10:58,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 137 transitions, 333 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:58,321 INFO L231 Difference]: Finished difference. Result has 143 places, 136 transitions, 303 flow [2025-04-29 11:10:58,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=143, PETRI_TRANSITIONS=136} [2025-04-29 11:10:58,322 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 1 predicate places. [2025-04-29 11:10:58,322 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 303 flow [2025-04-29 11:10:58,322 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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-04-29 11:10:58,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:58,322 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] [2025-04-29 11:10:58,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:10:58,322 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:10:58,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1868366638, now seen corresponding path program 1 times [2025-04-29 11:10:58,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:58,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466282074] [2025-04-29 11:10:58,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:58,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:58,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:10:58,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:10:58,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:58,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:58,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:58,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466282074] [2025-04-29 11:10:58,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466282074] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:58,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:58,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:58,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542101727] [2025-04-29 11:10:58,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:58,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:58,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:58,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:58,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:58,349 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 139 [2025-04-29 11:10:58,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 136 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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-04-29 11:10:58,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:58,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 139 [2025-04-29 11:10:58,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:58,510 INFO L116 PetriNetUnfolderBase]: 307/2366 cut-off events. [2025-04-29 11:10:58,510 INFO L117 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2025-04-29 11:10:58,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2988 conditions, 2366 events. 307/2366 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 19106 event pairs, 207 based on Foata normal form. 0/2153 useless extension candidates. Maximal degree in co-relation 2954. Up to 508 conditions per place. [2025-04-29 11:10:58,522 INFO L140 encePairwiseOnDemand]: 131/139 looper letters, 17 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2025-04-29 11:10:58,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 138 transitions, 361 flow [2025-04-29 11:10:58,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2025-04-29 11:10:58,524 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9160671462829736 [2025-04-29 11:10:58,524 INFO L175 Difference]: Start difference. First operand has 143 places, 136 transitions, 303 flow. Second operand 3 states and 382 transitions. [2025-04-29 11:10:58,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 138 transitions, 361 flow [2025-04-29 11:10:58,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 138 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:10:58,526 INFO L231 Difference]: Finished difference. Result has 139 places, 136 transitions, 319 flow [2025-04-29 11:10:58,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=139, PETRI_TRANSITIONS=136} [2025-04-29 11:10:58,526 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -3 predicate places. [2025-04-29 11:10:58,526 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 136 transitions, 319 flow [2025-04-29 11:10:58,527 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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-04-29 11:10:58,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:58,527 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] [2025-04-29 11:10:58,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:10:58,527 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:10:58,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:58,527 INFO L85 PathProgramCache]: Analyzing trace with hash -157664513, now seen corresponding path program 1 times [2025-04-29 11:10:58,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:58,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416454676] [2025-04-29 11:10:58,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:58,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:58,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:10:58,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:10:58,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:58,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:58,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:58,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416454676] [2025-04-29 11:10:58,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416454676] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:58,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:58,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:58,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943632964] [2025-04-29 11:10:58,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:58,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:10:58,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:58,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:10:58,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:10:58,610 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 139 [2025-04-29 11:10:58,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 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-04-29 11:10:58,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:58,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 139 [2025-04-29 11:10:58,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:58,678 INFO L116 PetriNetUnfolderBase]: 50/857 cut-off events. [2025-04-29 11:10:58,678 INFO L117 PetriNetUnfolderBase]: For 85/134 co-relation queries the response was YES. [2025-04-29 11:10:58,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 857 events. 50/857 cut-off events. For 85/134 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4704 event pairs, 17 based on Foata normal form. 2/799 useless extension candidates. Maximal degree in co-relation 603. Up to 98 conditions per place. [2025-04-29 11:10:58,683 INFO L140 encePairwiseOnDemand]: 131/139 looper letters, 16 selfloop transitions, 2 changer transitions 5/142 dead transitions. [2025-04-29 11:10:58,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 142 transitions, 377 flow [2025-04-29 11:10:58,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2025-04-29 11:10:58,684 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8992805755395683 [2025-04-29 11:10:58,684 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 319 flow. Second operand 6 states and 750 transitions. [2025-04-29 11:10:58,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 142 transitions, 377 flow [2025-04-29 11:10:58,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 142 transitions, 377 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:58,685 INFO L231 Difference]: Finished difference. Result has 148 places, 137 transitions, 341 flow [2025-04-29 11:10:58,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=341, PETRI_PLACES=148, PETRI_TRANSITIONS=137} [2025-04-29 11:10:58,686 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 6 predicate places. [2025-04-29 11:10:58,686 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 341 flow [2025-04-29 11:10:58,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 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-04-29 11:10:58,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:58,686 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] [2025-04-29 11:10:58,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:10:58,687 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:10:58,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:58,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1986346961, now seen corresponding path program 1 times [2025-04-29 11:10:58,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:58,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63935181] [2025-04-29 11:10:58,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:58,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:58,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:10:58,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:10:58,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:58,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:58,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:58,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63935181] [2025-04-29 11:10:58,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63935181] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:58,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:58,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:58,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779662429] [2025-04-29 11:10:58,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:58,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:58,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:58,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:59,029 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 139 [2025-04-29 11:10:59,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 341 flow. Second operand has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 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-04-29 11:10:59,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:59,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 139 [2025-04-29 11:10:59,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:00,724 INFO L116 PetriNetUnfolderBase]: 10319/23676 cut-off events. [2025-04-29 11:11:00,724 INFO L117 PetriNetUnfolderBase]: For 2022/2078 co-relation queries the response was YES. [2025-04-29 11:11:00,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40691 conditions, 23676 events. 10319/23676 cut-off events. For 2022/2078 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 240150 event pairs, 6820 based on Foata normal form. 0/21705 useless extension candidates. Maximal degree in co-relation 35539. Up to 14041 conditions per place. [2025-04-29 11:11:00,838 INFO L140 encePairwiseOnDemand]: 120/139 looper letters, 38 selfloop transitions, 54 changer transitions 0/192 dead transitions. [2025-04-29 11:11:00,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 192 transitions, 647 flow [2025-04-29 11:11:00,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions. [2025-04-29 11:11:00,839 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8441247002398081 [2025-04-29 11:11:00,839 INFO L175 Difference]: Start difference. First operand has 148 places, 137 transitions, 341 flow. Second operand 6 states and 704 transitions. [2025-04-29 11:11:00,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 192 transitions, 647 flow [2025-04-29 11:11:00,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 192 transitions, 635 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:00,845 INFO L231 Difference]: Finished difference. Result has 151 places, 190 transitions, 687 flow [2025-04-29 11:11:00,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=687, PETRI_PLACES=151, PETRI_TRANSITIONS=190} [2025-04-29 11:11:00,846 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 9 predicate places. [2025-04-29 11:11:00,846 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 190 transitions, 687 flow [2025-04-29 11:11:00,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 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-04-29 11:11:00,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:00,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:00,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:11:00,846 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:11:00,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1031089150, now seen corresponding path program 1 times [2025-04-29 11:11:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:00,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416089141] [2025-04-29 11:11:00,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:00,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:00,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:11:00,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:11:00,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:00,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:01,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:01,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416089141] [2025-04-29 11:11:01,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416089141] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:01,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:01,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:01,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504592787] [2025-04-29 11:11:01,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:01,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:01,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:01,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:01,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:01,211 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 139 [2025-04-29 11:11:01,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 190 transitions, 687 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:01,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:01,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 139 [2025-04-29 11:11:01,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:04,792 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L22-6-->L22-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][294], [139#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 44#L22-7true, 53#L22-8true, Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 174#true, 150#(= |#race~datas~0| 0), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 143#true, 141#true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), 22#L35-9true, 45#L22-11true, 163#true]) [2025-04-29 11:11:04,793 INFO L286 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-04-29 11:11:04,793 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-29 11:11:04,793 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-29 11:11:04,793 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-29 11:11:04,920 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L22-6-->L22-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][294], [139#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 44#L22-7true, Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 174#true, 150#(= |#race~datas~0| 0), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 143#true, 141#true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), 21#L22-9true, 22#L35-9true, 45#L22-11true, 163#true]) [2025-04-29 11:11:04,920 INFO L286 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2025-04-29 11:11:04,920 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-29 11:11:04,920 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-29 11:11:04,920 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-29 11:11:05,017 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L22-6-->L22-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][235], [139#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 44#L22-7true, Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 174#true, 150#(= |#race~datas~0| 0), 5#L22-7true, Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 143#true, 141#true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), 22#L35-9true, 64#L23true, 163#true]) [2025-04-29 11:11:05,017 INFO L286 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2025-04-29 11:11:05,017 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-29 11:11:05,017 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-29 11:11:05,017 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-29 11:11:05,039 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L22-6-->L22-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][294], [139#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 44#L22-7true, 14#L22-10true, Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 174#true, 150#(= |#race~datas~0| 0), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 143#true, 141#true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), 22#L35-9true, 45#L22-11true, 163#true]) [2025-04-29 11:11:05,039 INFO L286 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2025-04-29 11:11:05,039 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-04-29 11:11:05,039 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-04-29 11:11:05,039 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-04-29 11:11:06,277 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L22-6-->L22-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][235], [139#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 44#L22-7true, 53#L22-8true, Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 174#true, 150#(= |#race~datas~0| 0), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 143#true, 141#true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), 22#L35-9true, 64#L23true, 163#true]) [2025-04-29 11:11:06,277 INFO L286 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2025-04-29 11:11:06,277 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-04-29 11:11:06,277 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-04-29 11:11:06,277 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-04-29 11:11:07,528 INFO L116 PetriNetUnfolderBase]: 30404/70347 cut-off events. [2025-04-29 11:11:07,528 INFO L117 PetriNetUnfolderBase]: For 20486/25882 co-relation queries the response was YES. [2025-04-29 11:11:07,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157442 conditions, 70347 events. 30404/70347 cut-off events. For 20486/25882 co-relation queries the response was YES. Maximal size of possible extension queue 2172. Compared 815126 event pairs, 7852 based on Foata normal form. 103/64762 useless extension candidates. Maximal degree in co-relation 128654. Up to 30595 conditions per place. [2025-04-29 11:11:08,086 INFO L140 encePairwiseOnDemand]: 116/139 looper letters, 129 selfloop transitions, 118 changer transitions 0/352 dead transitions. [2025-04-29 11:11:08,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 352 transitions, 1953 flow [2025-04-29 11:11:08,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 756 transitions. [2025-04-29 11:11:08,088 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9064748201438849 [2025-04-29 11:11:08,088 INFO L175 Difference]: Start difference. First operand has 151 places, 190 transitions, 687 flow. Second operand 6 states and 756 transitions. [2025-04-29 11:11:08,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 352 transitions, 1953 flow [2025-04-29 11:11:08,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 352 transitions, 1953 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:08,184 INFO L231 Difference]: Finished difference. Result has 160 places, 307 transitions, 1760 flow [2025-04-29 11:11:08,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1760, PETRI_PLACES=160, PETRI_TRANSITIONS=307} [2025-04-29 11:11:08,184 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 18 predicate places. [2025-04-29 11:11:08,184 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 307 transitions, 1760 flow [2025-04-29 11:11:08,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:08,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:08,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:08,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:11:08,185 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:11:08,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:08,185 INFO L85 PathProgramCache]: Analyzing trace with hash -694977877, now seen corresponding path program 1 times [2025-04-29 11:11:08,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:08,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630310980] [2025-04-29 11:11:08,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:08,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:08,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:11:08,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:11:08,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:08,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:08,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:08,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630310980] [2025-04-29 11:11:08,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630310980] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:08,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:08,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:08,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474897781] [2025-04-29 11:11:08,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:08,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:08,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:08,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:08,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:08,465 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 139 [2025-04-29 11:11:08,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 307 transitions, 1760 flow. Second operand has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 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-04-29 11:11:08,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:08,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 139 [2025-04-29 11:11:08,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:16,228 INFO L116 PetriNetUnfolderBase]: 35386/83287 cut-off events. [2025-04-29 11:11:16,228 INFO L117 PetriNetUnfolderBase]: For 74921/80240 co-relation queries the response was YES. [2025-04-29 11:11:16,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243213 conditions, 83287 events. 35386/83287 cut-off events. For 74921/80240 co-relation queries the response was YES. Maximal size of possible extension queue 2612. Compared 1010794 event pairs, 8767 based on Foata normal form. 254/77787 useless extension candidates. Maximal degree in co-relation 233264. Up to 43638 conditions per place. [2025-04-29 11:11:16,960 INFO L140 encePairwiseOnDemand]: 120/139 looper letters, 192 selfloop transitions, 110 changer transitions 0/415 dead transitions. [2025-04-29 11:11:16,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 415 transitions, 3092 flow [2025-04-29 11:11:16,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2025-04-29 11:11:16,961 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8573141486810552 [2025-04-29 11:11:16,961 INFO L175 Difference]: Start difference. First operand has 160 places, 307 transitions, 1760 flow. Second operand 6 states and 715 transitions. [2025-04-29 11:11:16,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 415 transitions, 3092 flow [2025-04-29 11:11:17,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 415 transitions, 3074 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:17,435 INFO L231 Difference]: Finished difference. Result has 170 places, 412 transitions, 2987 flow [2025-04-29 11:11:17,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2987, PETRI_PLACES=170, PETRI_TRANSITIONS=412} [2025-04-29 11:11:17,436 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 28 predicate places. [2025-04-29 11:11:17,436 INFO L485 AbstractCegarLoop]: Abstraction has has 170 places, 412 transitions, 2987 flow [2025-04-29 11:11:17,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 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-04-29 11:11:17,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:17,436 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-29 11:11:17,436 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:11:17,436 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:11:17,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:17,437 INFO L85 PathProgramCache]: Analyzing trace with hash -675191098, now seen corresponding path program 1 times [2025-04-29 11:11:17,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:17,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254174471] [2025-04-29 11:11:17,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:17,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-29 11:11:17,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-29 11:11:17,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:17,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:17,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:17,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254174471] [2025-04-29 11:11:17,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254174471] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:17,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:17,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:11:17,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608665627] [2025-04-29 11:11:17,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:17,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:11:17,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:17,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:11:17,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:11:18,021 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 139 [2025-04-29 11:11:18,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 412 transitions, 2987 flow. Second operand has 11 states, 11 states have (on average 96.18181818181819) internal successors, (1058), 11 states have internal predecessors, (1058), 0 states have call successors, (0), 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-04-29 11:11:18,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:18,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 139 [2025-04-29 11:11:18,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:23,380 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L22-6-->L22-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][381], [139#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), 44#L22-7true, Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 187#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 213#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), 50#L22-10true, 174#true, Black: 178#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|)), Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 179#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|)), Black: 177#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 14#L22-10true, Black: 186#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 150#(= |#race~datas~0| 0), Black: 176#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 143#true, 141#true, 78#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), 184#true, 163#true]) [2025-04-29 11:11:23,381 INFO L286 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2025-04-29 11:11:23,381 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-29 11:11:23,381 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-29 11:11:23,381 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-29 11:11:24,823 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L22-6-->L22-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][381], [139#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), 44#L22-7true, Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 187#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 213#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), 50#L22-10true, 174#true, Black: 178#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|)), Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 179#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|)), Black: 177#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|)), 21#L22-9true, Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 186#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 150#(= |#race~datas~0| 0), Black: 176#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 143#true, 141#true, 78#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), 184#true, 163#true]) [2025-04-29 11:11:24,823 INFO L286 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-04-29 11:11:24,823 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-29 11:11:24,823 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-29 11:11:24,823 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event