./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const.i --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/thread-join-array-const.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3fabc1cc94c3126ff26eb9b915167fe6a6af37b0806df7c41554f022c4d5bcac --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:30:19,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:30:19,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:30:19,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:30:19,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:30:19,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:30:19,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:30:19,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:30:19,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:30:19,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:30:19,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:30:19,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:30:19,281 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:30:19,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:30:19,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:30:19,281 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:30:19,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:30:19,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:30:19,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:30:19,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:30:19,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:30:19,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:30:19,282 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:30:19,282 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:30:19,282 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:30:19,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:30:19,282 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:30:19,282 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:30:19,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:30:19,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:30:19,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:30:19,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:30:19,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:30:19,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:30:19,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:30:19,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:30:19,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:30:19,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:30:19,283 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:30:19,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:30:19,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:30:19,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:30:19,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:30:19,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:30:19,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:30:19,284 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 -> 3fabc1cc94c3126ff26eb9b915167fe6a6af37b0806df7c41554f022c4d5bcac [2025-04-30 10:30:19,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:30:19,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:30:19,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:30:19,507 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:30:19,508 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:30:19,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const.i [2025-04-30 10:30:20,797 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4633e2acd/b9251c1e6bfa4995add7b1bd0bed7d48/FLAG64a1dc63b [2025-04-30 10:30:21,020 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:30:21,021 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const.i [2025-04-30 10:30:21,034 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4633e2acd/b9251c1e6bfa4995add7b1bd0bed7d48/FLAG64a1dc63b [2025-04-30 10:30:21,797 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4633e2acd/b9251c1e6bfa4995add7b1bd0bed7d48 [2025-04-30 10:30:21,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:30:21,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:30:21,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:30:21,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:30:21,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:30:21,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:30:21" (1/1) ... [2025-04-30 10:30:21,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a627bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:21, skipping insertion in model container [2025-04-30 10:30:21,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:30:21" (1/1) ... [2025-04-30 10:30:21,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:30:22,119 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:30:22,129 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:30:22,178 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:30:22,207 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:30:22,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:22 WrapperNode [2025-04-30 10:30:22,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:30:22,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:30:22,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:30:22,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:30:22,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:22" (1/1) ... [2025-04-30 10:30:22,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:22" (1/1) ... [2025-04-30 10:30:22,237 INFO L138 Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2025-04-30 10:30:22,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:30:22,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:30:22,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:30:22,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:30:22,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:22" (1/1) ... [2025-04-30 10:30:22,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:22" (1/1) ... [2025-04-30 10:30:22,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:22" (1/1) ... [2025-04-30 10:30:22,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:22" (1/1) ... [2025-04-30 10:30:22,250 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:22" (1/1) ... [2025-04-30 10:30:22,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:22" (1/1) ... [2025-04-30 10:30:22,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:22" (1/1) ... [2025-04-30 10:30:22,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:22" (1/1) ... [2025-04-30 10:30:22,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:22" (1/1) ... [2025-04-30 10:30:22,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:30:22,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:30:22,257 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:30:22,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:30:22,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:22" (1/1) ... [2025-04-30 10:30:22,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:30:22,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:30:22,289 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-30 10:30:22,291 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-30 10:30:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:30:22,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:30:22,306 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:30:22,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:30:22,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:30:22,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:30:22,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:30:22,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-30 10:30:22,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-30 10:30:22,307 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:30:22,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:30:22,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:30:22,308 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:30:22,386 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:30:22,388 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:30:22,514 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:30:22,515 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:30:22,530 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:30:22,531 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:30:22,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:30:22 BoogieIcfgContainer [2025-04-30 10:30:22,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:30:22,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:30:22,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:30:22,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:30:22,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:30:21" (1/3) ... [2025-04-30 10:30:22,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f6ec94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:30:22, skipping insertion in model container [2025-04-30 10:30:22,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:22" (2/3) ... [2025-04-30 10:30:22,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f6ec94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:30:22, skipping insertion in model container [2025-04-30 10:30:22,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:30:22" (3/3) ... [2025-04-30 10:30:22,538 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const.i [2025-04-30 10:30:22,551 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:30:22,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-const.i that has 2 procedures, 76 locations, 76 edges, 1 initial locations, 2 loop locations, and 4 error locations. [2025-04-30 10:30:22,555 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:30:22,591 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-30 10:30:22,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 77 transitions, 161 flow [2025-04-30 10:30:22,660 INFO L116 PetriNetUnfolderBase]: 1/110 cut-off events. [2025-04-30 10:30:22,662 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:30:22,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 110 events. 1/110 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 210 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 4. Up to 3 conditions per place. [2025-04-30 10:30:22,664 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 77 transitions, 161 flow [2025-04-30 10:30:22,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 77 transitions, 161 flow [2025-04-30 10:30:22,678 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:30:22,689 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;@3e5a89ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:30:22,689 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-30 10:30:22,699 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:30:22,700 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-30 10:30:22,701 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:30:22,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:22,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:22,703 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:30:22,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:22,708 INFO L85 PathProgramCache]: Analyzing trace with hash -435345755, now seen corresponding path program 1 times [2025-04-30 10:30:22,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:22,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748792782] [2025-04-30 10:30:22,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:22,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:22,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:30:22,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:30:22,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:22,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:22,913 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-30 10:30:22,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:22,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748792782] [2025-04-30 10:30:22,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748792782] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:22,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:22,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:22,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451882056] [2025-04-30 10:30:22,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:22,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:22,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:22,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:22,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:22,985 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 77 [2025-04-30 10:30:22,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 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-30 10:30:22,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:22,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 77 [2025-04-30 10:30:22,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:23,054 INFO L116 PetriNetUnfolderBase]: 8/187 cut-off events. [2025-04-30 10:30:23,054 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:30:23,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 187 events. 8/187 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 570 event pairs, 0 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 155. Up to 17 conditions per place. [2025-04-30 10:30:23,056 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 10 selfloop transitions, 4 changer transitions 1/81 dead transitions. [2025-04-30 10:30:23,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 199 flow [2025-04-30 10:30:23,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2025-04-30 10:30:23,071 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-04-30 10:30:23,074 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 161 flow. Second operand 4 states and 280 transitions. [2025-04-30 10:30:23,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 199 flow [2025-04-30 10:30:23,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 81 transitions, 199 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:23,083 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 173 flow [2025-04-30 10:30:23,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2025-04-30 10:30:23,087 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2025-04-30 10:30:23,088 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 173 flow [2025-04-30 10:30:23,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 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-30 10:30:23,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:23,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:23,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:30:23,089 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:30:23,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:23,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1878811919, now seen corresponding path program 1 times [2025-04-30 10:30:23,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:23,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809909343] [2025-04-30 10:30:23,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:23,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:23,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:30:23,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:30:23,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:23,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:23,470 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-30 10:30:23,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:23,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809909343] [2025-04-30 10:30:23,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809909343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:23,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:23,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134841349] [2025-04-30 10:30:23,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:23,473 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:23,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:23,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:23,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:23,587 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 77 [2025-04-30 10:30:23,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 0 states have call successors, (0), 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-30 10:30:23,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:23,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 77 [2025-04-30 10:30:23,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:23,674 INFO L116 PetriNetUnfolderBase]: 30/231 cut-off events. [2025-04-30 10:30:23,674 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-30 10:30:23,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 231 events. 30/231 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 924 event pairs, 11 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 268. Up to 62 conditions per place. [2025-04-30 10:30:23,678 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 25 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2025-04-30 10:30:23,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 84 transitions, 247 flow [2025-04-30 10:30:23,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 355 transitions. [2025-04-30 10:30:23,680 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7683982683982684 [2025-04-30 10:30:23,681 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 173 flow. Second operand 6 states and 355 transitions. [2025-04-30 10:30:23,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 84 transitions, 247 flow [2025-04-30 10:30:23,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 84 transitions, 239 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:23,683 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 173 flow [2025-04-30 10:30:23,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2025-04-30 10:30:23,684 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 5 predicate places. [2025-04-30 10:30:23,684 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 173 flow [2025-04-30 10:30:23,684 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 0 states have call successors, (0), 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-30 10:30:23,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:23,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:23,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:30:23,684 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:30:23,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash 874120931, now seen corresponding path program 1 times [2025-04-30 10:30:23,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:23,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139920788] [2025-04-30 10:30:23,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:23,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:30:23,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:30:23,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:23,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:23,744 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-30 10:30:23,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:23,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139920788] [2025-04-30 10:30:23,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139920788] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:23,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:23,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:23,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377174528] [2025-04-30 10:30:23,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:23,746 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:23,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:23,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:23,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:23,755 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 77 [2025-04-30 10:30:23,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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-30 10:30:23,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:23,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 77 [2025-04-30 10:30:23,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:23,779 INFO L116 PetriNetUnfolderBase]: 6/143 cut-off events. [2025-04-30 10:30:23,779 INFO L117 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2025-04-30 10:30:23,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 143 events. 6/143 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 381 event pairs, 4 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 136. Up to 21 conditions per place. [2025-04-30 10:30:23,780 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 9 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2025-04-30 10:30:23,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 205 flow [2025-04-30 10:30:23,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2025-04-30 10:30:23,782 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9307359307359307 [2025-04-30 10:30:23,782 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 173 flow. Second operand 3 states and 215 transitions. [2025-04-30 10:30:23,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 205 flow [2025-04-30 10:30:23,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 195 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:30:23,785 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 193 flow [2025-04-30 10:30:23,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2025-04-30 10:30:23,785 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2025-04-30 10:30:23,785 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 193 flow [2025-04-30 10:30:23,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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-30 10:30:23,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:23,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:23,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:30:23,786 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:30:23,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:23,786 INFO L85 PathProgramCache]: Analyzing trace with hash -317364517, now seen corresponding path program 1 times [2025-04-30 10:30:23,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:23,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328585977] [2025-04-30 10:30:23,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:23,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:23,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:30:23,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:30:23,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:23,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:23,854 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-30 10:30:23,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:23,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328585977] [2025-04-30 10:30:23,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328585977] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:23,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:23,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:23,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083875139] [2025-04-30 10:30:23,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:23,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:23,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:23,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:23,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:23,892 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 77 [2025-04-30 10:30:23,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 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-30 10:30:23,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:23,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 77 [2025-04-30 10:30:23,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:23,915 INFO L116 PetriNetUnfolderBase]: 2/108 cut-off events. [2025-04-30 10:30:23,915 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-30 10:30:23,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 108 events. 2/108 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 154 event pairs, 0 based on Foata normal form. 3/106 useless extension candidates. Maximal degree in co-relation 83. Up to 7 conditions per place. [2025-04-30 10:30:23,916 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 9 selfloop transitions, 3 changer transitions 7/77 dead transitions. [2025-04-30 10:30:23,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 77 transitions, 203 flow [2025-04-30 10:30:23,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 278 transitions. [2025-04-30 10:30:23,918 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9025974025974026 [2025-04-30 10:30:23,918 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 193 flow. Second operand 4 states and 278 transitions. [2025-04-30 10:30:23,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 77 transitions, 203 flow [2025-04-30 10:30:23,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 77 transitions, 191 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-30 10:30:23,919 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 157 flow [2025-04-30 10:30:23,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2025-04-30 10:30:23,920 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places. [2025-04-30 10:30:23,920 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 157 flow [2025-04-30 10:30:23,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 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-30 10:30:23,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:23,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:23,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:30:23,920 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:30:23,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:23,921 INFO L85 PathProgramCache]: Analyzing trace with hash 461962144, now seen corresponding path program 1 times [2025-04-30 10:30:23,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:23,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397044817] [2025-04-30 10:30:23,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:23,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:23,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:30:23,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:30:23,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:23,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:30:24,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:24,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397044817] [2025-04-30 10:30:24,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397044817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:24,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:24,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:30:24,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294066376] [2025-04-30 10:30:24,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:24,015 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:24,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:24,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:24,061 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-04-30 10:30:24,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 0 states have call successors, (0), 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-30 10:30:24,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:24,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-04-30 10:30:24,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:24,106 INFO L116 PetriNetUnfolderBase]: 6/95 cut-off events. [2025-04-30 10:30:24,106 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:30:24,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 95 events. 6/95 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 146 event pairs, 0 based on Foata normal form. 3/97 useless extension candidates. Maximal degree in co-relation 122. Up to 5 conditions per place. [2025-04-30 10:30:24,107 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 10 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-04-30 10:30:24,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 146 flow [2025-04-30 10:30:24,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:30:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:30:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 464 transitions. [2025-04-30 10:30:24,108 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8608534322820037 [2025-04-30 10:30:24,108 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 157 flow. Second operand 7 states and 464 transitions. [2025-04-30 10:30:24,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 146 flow [2025-04-30 10:30:24,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:24,110 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 111 flow [2025-04-30 10:30:24,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-04-30 10:30:24,111 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -20 predicate places. [2025-04-30 10:30:24,111 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 111 flow [2025-04-30 10:30:24,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 0 states have call successors, (0), 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-30 10:30:24,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:24,112 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:24,112 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:30:24,112 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:30:24,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1534161632, now seen corresponding path program 1 times [2025-04-30 10:30:24,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:24,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940828390] [2025-04-30 10:30:24,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:24,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:24,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:30:24,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:30:24,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:24,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:24,128 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:30:24,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:30:24,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:30:24,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:24,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:24,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:30:24,149 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:30:24,150 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-30 10:30:24,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-04-30 10:30:24,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-04-30 10:30:24,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-04-30 10:30:24,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-04-30 10:30:24,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-04-30 10:30:24,153 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:30:24,153 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-30 10:30:24,155 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:30:24,155 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-30 10:30:24,169 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-30 10:30:24,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 95 transitions, 206 flow [2025-04-30 10:30:24,192 INFO L116 PetriNetUnfolderBase]: 3/196 cut-off events. [2025-04-30 10:30:24,192 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-30 10:30:24,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 196 events. 3/196 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 460 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 112. Up to 6 conditions per place. [2025-04-30 10:30:24,193 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 95 transitions, 206 flow [2025-04-30 10:30:24,194 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 95 transitions, 206 flow [2025-04-30 10:30:24,194 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:30:24,195 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;@3e5a89ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:30:24,195 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-30 10:30:24,203 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:30:24,204 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-30 10:30:24,204 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:30:24,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:24,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:24,205 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:24,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1504386747, now seen corresponding path program 1 times [2025-04-30 10:30:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:24,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561329251] [2025-04-30 10:30:24,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:24,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:30:24,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:30:24,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:24,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:24,240 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-30 10:30:24,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:24,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561329251] [2025-04-30 10:30:24,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561329251] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:24,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:24,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:24,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537969074] [2025-04-30 10:30:24,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:24,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:24,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:24,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:24,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:24,278 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2025-04-30 10:30:24,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 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-30 10:30:24,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:24,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2025-04-30 10:30:24,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:24,356 INFO L116 PetriNetUnfolderBase]: 72/621 cut-off events. [2025-04-30 10:30:24,357 INFO L117 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-04-30 10:30:24,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 621 events. 72/621 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3700 event pairs, 20 based on Foata normal form. 1/566 useless extension candidates. Maximal degree in co-relation 215. Up to 106 conditions per place. [2025-04-30 10:30:24,363 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 18 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2025-04-30 10:30:24,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 102 transitions, 264 flow [2025-04-30 10:30:24,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2025-04-30 10:30:24,365 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9026315789473685 [2025-04-30 10:30:24,365 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 206 flow. Second operand 4 states and 343 transitions. [2025-04-30 10:30:24,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 102 transitions, 264 flow [2025-04-30 10:30:24,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 102 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:24,368 INFO L231 Difference]: Finished difference. Result has 102 places, 96 transitions, 222 flow [2025-04-30 10:30:24,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=102, PETRI_TRANSITIONS=96} [2025-04-30 10:30:24,369 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2025-04-30 10:30:24,369 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 96 transitions, 222 flow [2025-04-30 10:30:24,370 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 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-30 10:30:24,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:24,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:24,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:30:24,371 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:24,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:24,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1261213422, now seen corresponding path program 1 times [2025-04-30 10:30:24,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:24,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006001601] [2025-04-30 10:30:24,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:24,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:24,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:30:24,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:30:24,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:24,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:24,529 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-30 10:30:24,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:24,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006001601] [2025-04-30 10:30:24,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006001601] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:24,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:24,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:24,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658733430] [2025-04-30 10:30:24,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:24,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:24,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:24,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:24,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:24,623 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 95 [2025-04-30 10:30:24,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 96 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 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-30 10:30:24,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:24,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 95 [2025-04-30 10:30:24,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:24,772 INFO L116 PetriNetUnfolderBase]: 236/966 cut-off events. [2025-04-30 10:30:24,773 INFO L117 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-04-30 10:30:24,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 966 events. 236/966 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6801 event pairs, 34 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 457. Up to 313 conditions per place. [2025-04-30 10:30:24,779 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 38 selfloop transitions, 5 changer transitions 0/111 dead transitions. [2025-04-30 10:30:24,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 111 transitions, 338 flow [2025-04-30 10:30:24,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 451 transitions. [2025-04-30 10:30:24,781 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7912280701754386 [2025-04-30 10:30:24,781 INFO L175 Difference]: Start difference. First operand has 102 places, 96 transitions, 222 flow. Second operand 6 states and 451 transitions. [2025-04-30 10:30:24,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 111 transitions, 338 flow [2025-04-30 10:30:24,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 111 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:24,788 INFO L231 Difference]: Finished difference. Result has 104 places, 95 transitions, 224 flow [2025-04-30 10:30:24,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=104, PETRI_TRANSITIONS=95} [2025-04-30 10:30:24,788 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2025-04-30 10:30:24,788 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 224 flow [2025-04-30 10:30:24,789 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 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-30 10:30:24,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:24,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:24,789 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:30:24,789 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:24,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:24,789 INFO L85 PathProgramCache]: Analyzing trace with hash 326716242, now seen corresponding path program 1 times [2025-04-30 10:30:24,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:24,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483441179] [2025-04-30 10:30:24,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:24,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:24,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:30:24,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:30:24,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:24,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:24,816 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-30 10:30:24,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:24,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483441179] [2025-04-30 10:30:24,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483441179] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:24,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:24,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:24,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131658033] [2025-04-30 10:30:24,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:24,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:24,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:24,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:24,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:24,833 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2025-04-30 10:30:24,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 95 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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-30 10:30:24,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:24,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2025-04-30 10:30:24,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:24,904 INFO L116 PetriNetUnfolderBase]: 113/682 cut-off events. [2025-04-30 10:30:24,904 INFO L117 PetriNetUnfolderBase]: For 97/142 co-relation queries the response was YES. [2025-04-30 10:30:24,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 682 events. 113/682 cut-off events. For 97/142 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4292 event pairs, 73 based on Foata normal form. 3/606 useless extension candidates. Maximal degree in co-relation 734. Up to 182 conditions per place. [2025-04-30 10:30:24,908 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 18 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2025-04-30 10:30:24,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 103 transitions, 294 flow [2025-04-30 10:30:24,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2025-04-30 10:30:24,910 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9263157894736842 [2025-04-30 10:30:24,910 INFO L175 Difference]: Start difference. First operand has 104 places, 95 transitions, 224 flow. Second operand 3 states and 264 transitions. [2025-04-30 10:30:24,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 103 transitions, 294 flow [2025-04-30 10:30:24,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 103 transitions, 284 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:30:24,912 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 252 flow [2025-04-30 10:30:24,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2025-04-30 10:30:24,912 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2025-04-30 10:30:24,914 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 252 flow [2025-04-30 10:30:24,914 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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-30 10:30:24,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:24,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:24,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:30:24,915 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:24,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash -914654326, now seen corresponding path program 1 times [2025-04-30 10:30:24,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:24,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728821898] [2025-04-30 10:30:24,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:24,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:24,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:30:24,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:30:24,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:24,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:24,989 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-30 10:30:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:24,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728821898] [2025-04-30 10:30:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728821898] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:24,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:24,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:24,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813697911] [2025-04-30 10:30:24,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:24,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:24,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:24,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:24,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:25,019 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2025-04-30 10:30:25,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 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-30 10:30:25,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:25,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2025-04-30 10:30:25,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:25,077 INFO L116 PetriNetUnfolderBase]: 57/561 cut-off events. [2025-04-30 10:30:25,077 INFO L117 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-04-30 10:30:25,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 561 events. 57/561 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3012 event pairs, 20 based on Foata normal form. 15/532 useless extension candidates. Maximal degree in co-relation 618. Up to 66 conditions per place. [2025-04-30 10:30:25,080 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 20 selfloop transitions, 4 changer transitions 2/110 dead transitions. [2025-04-30 10:30:25,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 110 transitions, 332 flow [2025-04-30 10:30:25,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2025-04-30 10:30:25,081 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9131578947368421 [2025-04-30 10:30:25,081 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 252 flow. Second operand 4 states and 347 transitions. [2025-04-30 10:30:25,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 110 transitions, 332 flow [2025-04-30 10:30:25,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 110 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:25,083 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 258 flow [2025-04-30 10:30:25,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2025-04-30 10:30:25,084 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2025-04-30 10:30:25,084 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 258 flow [2025-04-30 10:30:25,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 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-30 10:30:25,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:25,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:25,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:30:25,084 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:25,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:25,085 INFO L85 PathProgramCache]: Analyzing trace with hash 650863888, now seen corresponding path program 1 times [2025-04-30 10:30:25,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:25,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055754101] [2025-04-30 10:30:25,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:25,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:25,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:30:25,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:30:25,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:25,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:25,158 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-30 10:30:25,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:25,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055754101] [2025-04-30 10:30:25,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055754101] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:25,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:25,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:30:25,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184086743] [2025-04-30 10:30:25,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:25,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:25,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:25,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:25,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:25,220 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 95 [2025-04-30 10:30:25,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 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-30 10:30:25,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:25,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 95 [2025-04-30 10:30:25,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:25,345 INFO L116 PetriNetUnfolderBase]: 117/892 cut-off events. [2025-04-30 10:30:25,345 INFO L117 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-04-30 10:30:25,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 892 events. 117/892 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5614 event pairs, 16 based on Foata normal form. 3/814 useless extension candidates. Maximal degree in co-relation 765. Up to 130 conditions per place. [2025-04-30 10:30:25,349 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 24 selfloop transitions, 7 changer transitions 3/116 dead transitions. [2025-04-30 10:30:25,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 116 transitions, 358 flow [2025-04-30 10:30:25,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:30:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:30:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 581 transitions. [2025-04-30 10:30:25,351 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8736842105263158 [2025-04-30 10:30:25,351 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 258 flow. Second operand 7 states and 581 transitions. [2025-04-30 10:30:25,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 116 transitions, 358 flow [2025-04-30 10:30:25,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 116 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:25,354 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 282 flow [2025-04-30 10:30:25,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2025-04-30 10:30:25,355 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 14 predicate places. [2025-04-30 10:30:25,355 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 282 flow [2025-04-30 10:30:25,356 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 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-30 10:30:25,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:25,356 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:25,356 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:30:25,357 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:25,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash 727822940, now seen corresponding path program 1 times [2025-04-30 10:30:25,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:25,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089703592] [2025-04-30 10:30:25,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:25,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:25,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:30:25,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:30:25,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:25,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:25,395 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-30 10:30:25,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:25,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089703592] [2025-04-30 10:30:25,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089703592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:25,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:25,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:25,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234785388] [2025-04-30 10:30:25,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:25,396 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:25,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:25,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:25,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:25,408 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2025-04-30 10:30:25,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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-30 10:30:25,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:25,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2025-04-30 10:30:25,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:25,480 INFO L116 PetriNetUnfolderBase]: 58/596 cut-off events. [2025-04-30 10:30:25,480 INFO L117 PetriNetUnfolderBase]: For 132/185 co-relation queries the response was YES. [2025-04-30 10:30:25,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 596 events. 58/596 cut-off events. For 132/185 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3456 event pairs, 32 based on Foata normal form. 3/552 useless extension candidates. Maximal degree in co-relation 784. Up to 111 conditions per place. [2025-04-30 10:30:25,483 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 18 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-04-30 10:30:25,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 109 transitions, 351 flow [2025-04-30 10:30:25,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:25,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-04-30 10:30:25,485 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2025-04-30 10:30:25,485 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 282 flow. Second operand 3 states and 263 transitions. [2025-04-30 10:30:25,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 109 transitions, 351 flow [2025-04-30 10:30:25,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 109 transitions, 341 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:25,488 INFO L231 Difference]: Finished difference. Result has 113 places, 106 transitions, 318 flow [2025-04-30 10:30:25,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=113, PETRI_TRANSITIONS=106} [2025-04-30 10:30:25,489 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 15 predicate places. [2025-04-30 10:30:25,489 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 318 flow [2025-04-30 10:30:25,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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-30 10:30:25,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:25,490 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:25,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:30:25,490 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:25,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:25,490 INFO L85 PathProgramCache]: Analyzing trace with hash -192608042, now seen corresponding path program 1 times [2025-04-30 10:30:25,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:25,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745087861] [2025-04-30 10:30:25,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:25,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:25,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:30:25,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:30:25,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:25,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:25,613 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-30 10:30:25,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:25,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745087861] [2025-04-30 10:30:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745087861] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:25,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:30:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799215925] [2025-04-30 10:30:25,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:25,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:30:25,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:25,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:30:25,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:30:25,675 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 95 [2025-04-30 10:30:25,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 318 flow. Second operand has 8 states, 8 states have (on average 79.625) internal successors, (637), 8 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-30 10:30:25,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:25,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 95 [2025-04-30 10:30:25,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:25,796 INFO L116 PetriNetUnfolderBase]: 71/430 cut-off events. [2025-04-30 10:30:25,796 INFO L117 PetriNetUnfolderBase]: For 102/106 co-relation queries the response was YES. [2025-04-30 10:30:25,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 430 events. 71/430 cut-off events. For 102/106 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2237 event pairs, 1 based on Foata normal form. 14/433 useless extension candidates. Maximal degree in co-relation 701. Up to 32 conditions per place. [2025-04-30 10:30:25,798 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 25 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2025-04-30 10:30:25,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 328 flow [2025-04-30 10:30:25,799 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:30:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:30:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 814 transitions. [2025-04-30 10:30:25,800 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8568421052631578 [2025-04-30 10:30:25,800 INFO L175 Difference]: Start difference. First operand has 113 places, 106 transitions, 318 flow. Second operand 10 states and 814 transitions. [2025-04-30 10:30:25,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 328 flow [2025-04-30 10:30:25,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 93 transitions, 314 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:30:25,802 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 228 flow [2025-04-30 10:30:25,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=228, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2025-04-30 10:30:25,803 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, -7 predicate places. [2025-04-30 10:30:25,803 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 228 flow [2025-04-30 10:30:25,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 79.625) internal successors, (637), 8 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-30 10:30:25,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:25,803 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:25,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:30:25,803 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:25,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1577644839, now seen corresponding path program 1 times [2025-04-30 10:30:25,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:25,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625815201] [2025-04-30 10:30:25,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:25,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:25,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:30:25,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:30:25,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:25,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:25,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:30:25,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:30:25,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:30:25,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:25,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:25,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:30:25,833 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:30:25,833 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-30 10:30:25,833 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-30 10:30:25,834 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-04-30 10:30:25,834 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-30 10:30:25,834 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-30 10:30:25,834 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-30 10:30:25,834 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-30 10:30:25,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:30:25,834 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:25,835 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:30:25,835 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-30 10:30:25,855 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-30 10:30:25,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 113 transitions, 253 flow [2025-04-30 10:30:25,877 INFO L116 PetriNetUnfolderBase]: 8/333 cut-off events. [2025-04-30 10:30:25,877 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-30 10:30:25,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 333 events. 8/333 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 957 event pairs, 1 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 204. Up to 12 conditions per place. [2025-04-30 10:30:25,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 113 transitions, 253 flow [2025-04-30 10:30:25,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 113 transitions, 253 flow [2025-04-30 10:30:25,881 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:30:25,881 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;@3e5a89ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:30:25,881 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-30 10:30:25,884 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:30:25,884 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-30 10:30:25,884 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:30:25,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:25,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:25,884 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:25,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:25,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1826569051, now seen corresponding path program 1 times [2025-04-30 10:30:25,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:25,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042585339] [2025-04-30 10:30:25,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:25,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:25,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:30:25,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:30:25,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:25,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:25,914 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-30 10:30:25,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:25,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042585339] [2025-04-30 10:30:25,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042585339] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:25,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:25,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288238122] [2025-04-30 10:30:25,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:25,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:25,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:25,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:25,942 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 113 [2025-04-30 10:30:25,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 113 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:25,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:25,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 113 [2025-04-30 10:30:25,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:26,125 INFO L116 PetriNetUnfolderBase]: 413/2217 cut-off events. [2025-04-30 10:30:26,126 INFO L117 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2025-04-30 10:30:26,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2991 conditions, 2217 events. 413/2217 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 17779 event pairs, 232 based on Foata normal form. 1/2031 useless extension candidates. Maximal degree in co-relation 1335. Up to 496 conditions per place. [2025-04-30 10:30:26,137 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 24 selfloop transitions, 4 changer transitions 0/122 dead transitions. [2025-04-30 10:30:26,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 122 transitions, 327 flow [2025-04-30 10:30:26,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2025-04-30 10:30:26,139 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8960176991150443 [2025-04-30 10:30:26,139 INFO L175 Difference]: Start difference. First operand has 117 places, 113 transitions, 253 flow. Second operand 4 states and 405 transitions. [2025-04-30 10:30:26,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 122 transitions, 327 flow [2025-04-30 10:30:26,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 122 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:26,141 INFO L231 Difference]: Finished difference. Result has 121 places, 114 transitions, 269 flow [2025-04-30 10:30:26,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=121, PETRI_TRANSITIONS=114} [2025-04-30 10:30:26,142 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 4 predicate places. [2025-04-30 10:30:26,143 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 114 transitions, 269 flow [2025-04-30 10:30:26,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:26,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:26,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:26,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:30:26,143 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:26,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:26,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1914753569, now seen corresponding path program 1 times [2025-04-30 10:30:26,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:26,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104972108] [2025-04-30 10:30:26,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:26,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:26,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:30:26,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:30:26,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:26,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:26,277 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-30 10:30:26,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:26,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104972108] [2025-04-30 10:30:26,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104972108] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:26,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:26,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136463449] [2025-04-30 10:30:26,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:26,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:26,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:26,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:26,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:26,345 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 113 [2025-04-30 10:30:26,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 114 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 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-30 10:30:26,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:26,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 113 [2025-04-30 10:30:26,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:26,720 INFO L116 PetriNetUnfolderBase]: 1295/3992 cut-off events. [2025-04-30 10:30:26,720 INFO L117 PetriNetUnfolderBase]: For 327/327 co-relation queries the response was YES. [2025-04-30 10:30:26,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6344 conditions, 3992 events. 1295/3992 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 35294 event pairs, 181 based on Foata normal form. 0/3711 useless extension candidates. Maximal degree in co-relation 5668. Up to 1483 conditions per place. [2025-04-30 10:30:26,743 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 50 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-04-30 10:30:26,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 137 transitions, 425 flow [2025-04-30 10:30:26,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 547 transitions. [2025-04-30 10:30:26,745 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8067846607669616 [2025-04-30 10:30:26,745 INFO L175 Difference]: Start difference. First operand has 121 places, 114 transitions, 269 flow. Second operand 6 states and 547 transitions. [2025-04-30 10:30:26,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 137 transitions, 425 flow [2025-04-30 10:30:26,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 137 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:26,749 INFO L231 Difference]: Finished difference. Result has 123 places, 113 transitions, 271 flow [2025-04-30 10:30:26,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=123, PETRI_TRANSITIONS=113} [2025-04-30 10:30:26,749 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2025-04-30 10:30:26,749 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 113 transitions, 271 flow [2025-04-30 10:30:26,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 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-30 10:30:26,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:26,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:26,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:30:26,750 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:26,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash 739877299, now seen corresponding path program 1 times [2025-04-30 10:30:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:26,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275950133] [2025-04-30 10:30:26,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:26,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:26,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:30:26,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:30:26,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:26,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:26,781 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-30 10:30:26,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:26,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275950133] [2025-04-30 10:30:26,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275950133] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:26,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:26,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:26,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413918024] [2025-04-30 10:30:26,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:26,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:26,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:26,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:26,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:26,799 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 113 [2025-04-30 10:30:26,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 113 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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-30 10:30:26,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:26,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 113 [2025-04-30 10:30:26,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:27,089 INFO L116 PetriNetUnfolderBase]: 1006/3964 cut-off events. [2025-04-30 10:30:27,089 INFO L117 PetriNetUnfolderBase]: For 807/971 co-relation queries the response was YES. [2025-04-30 10:30:27,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5877 conditions, 3964 events. 1006/3964 cut-off events. For 807/971 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 37671 event pairs, 683 based on Foata normal form. 6/3512 useless extension candidates. Maximal degree in co-relation 4693. Up to 1312 conditions per place. [2025-04-30 10:30:27,114 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 27 selfloop transitions, 6 changer transitions 0/126 dead transitions. [2025-04-30 10:30:27,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 126 transitions, 381 flow [2025-04-30 10:30:27,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2025-04-30 10:30:27,119 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9233038348082596 [2025-04-30 10:30:27,119 INFO L175 Difference]: Start difference. First operand has 123 places, 113 transitions, 271 flow. Second operand 3 states and 313 transitions. [2025-04-30 10:30:27,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 126 transitions, 381 flow [2025-04-30 10:30:27,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 126 transitions, 371 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:30:27,121 INFO L231 Difference]: Finished difference. Result has 122 places, 118 transitions, 307 flow [2025-04-30 10:30:27,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=122, PETRI_TRANSITIONS=118} [2025-04-30 10:30:27,121 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2025-04-30 10:30:27,121 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 118 transitions, 307 flow [2025-04-30 10:30:27,121 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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-30 10:30:27,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:27,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:27,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:30:27,122 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:27,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash 223997323, now seen corresponding path program 1 times [2025-04-30 10:30:27,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:27,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134834525] [2025-04-30 10:30:27,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:27,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:27,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:30:27,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:30:27,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:27,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:27,160 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-30 10:30:27,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:27,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134834525] [2025-04-30 10:30:27,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134834525] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:27,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:27,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:27,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278836055] [2025-04-30 10:30:27,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:27,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:27,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:27,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:27,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:27,191 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 113 [2025-04-30 10:30:27,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 118 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 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-30 10:30:27,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:27,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 113 [2025-04-30 10:30:27,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:27,416 INFO L116 PetriNetUnfolderBase]: 616/3187 cut-off events. [2025-04-30 10:30:27,416 INFO L117 PetriNetUnfolderBase]: For 440/444 co-relation queries the response was YES. [2025-04-30 10:30:27,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4715 conditions, 3187 events. 616/3187 cut-off events. For 440/444 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 29079 event pairs, 252 based on Foata normal form. 63/2922 useless extension candidates. Maximal degree in co-relation 3838. Up to 511 conditions per place. [2025-04-30 10:30:27,435 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 31 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-04-30 10:30:27,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 134 transitions, 418 flow [2025-04-30 10:30:27,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2025-04-30 10:30:27,437 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.911504424778761 [2025-04-30 10:30:27,437 INFO L175 Difference]: Start difference. First operand has 122 places, 118 transitions, 307 flow. Second operand 4 states and 412 transitions. [2025-04-30 10:30:27,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 134 transitions, 418 flow [2025-04-30 10:30:27,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 134 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:27,439 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 311 flow [2025-04-30 10:30:27,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=124, PETRI_TRANSITIONS=119} [2025-04-30 10:30:27,440 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 7 predicate places. [2025-04-30 10:30:27,440 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 311 flow [2025-04-30 10:30:27,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 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-30 10:30:27,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:27,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:27,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:30:27,441 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:27,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:27,441 INFO L85 PathProgramCache]: Analyzing trace with hash 570547648, now seen corresponding path program 1 times [2025-04-30 10:30:27,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:27,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405840669] [2025-04-30 10:30:27,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:27,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:27,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:30:27,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:30:27,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:27,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:30:27,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:27,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405840669] [2025-04-30 10:30:27,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405840669] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:27,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:27,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:30:27,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538243122] [2025-04-30 10:30:27,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:27,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:27,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:27,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:27,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:27,551 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2025-04-30 10:30:27,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 119 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 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-30 10:30:27,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:27,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2025-04-30 10:30:27,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:27,968 INFO L116 PetriNetUnfolderBase]: 950/4903 cut-off events. [2025-04-30 10:30:27,968 INFO L117 PetriNetUnfolderBase]: For 649/649 co-relation queries the response was YES. [2025-04-30 10:30:27,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7128 conditions, 4903 events. 950/4903 cut-off events. For 649/649 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 49321 event pairs, 310 based on Foata normal form. 3/4329 useless extension candidates. Maximal degree in co-relation 3734. Up to 1100 conditions per place. [2025-04-30 10:30:27,995 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 35 selfloop transitions, 7 changer transitions 0/139 dead transitions. [2025-04-30 10:30:27,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 139 transitions, 437 flow [2025-04-30 10:30:27,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:30:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:30:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 687 transitions. [2025-04-30 10:30:27,997 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8685208596713021 [2025-04-30 10:30:27,997 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 311 flow. Second operand 7 states and 687 transitions. [2025-04-30 10:30:27,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 139 transitions, 437 flow [2025-04-30 10:30:28,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 139 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:28,003 INFO L231 Difference]: Finished difference. Result has 131 places, 122 transitions, 341 flow [2025-04-30 10:30:28,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=131, PETRI_TRANSITIONS=122} [2025-04-30 10:30:28,003 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 14 predicate places. [2025-04-30 10:30:28,004 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 122 transitions, 341 flow [2025-04-30 10:30:28,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 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-30 10:30:28,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:28,004 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:28,004 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:30:28,004 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:28,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:28,005 INFO L85 PathProgramCache]: Analyzing trace with hash 848959388, now seen corresponding path program 1 times [2025-04-30 10:30:28,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:28,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307776099] [2025-04-30 10:30:28,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:28,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:28,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:30:28,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:30:28,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:28,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:30:28,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:28,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307776099] [2025-04-30 10:30:28,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307776099] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:28,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:28,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:28,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526967109] [2025-04-30 10:30:28,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:28,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:28,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:28,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:28,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:28,048 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 113 [2025-04-30 10:30:28,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 122 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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-30 10:30:28,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:28,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 113 [2025-04-30 10:30:28,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:28,434 INFO L116 PetriNetUnfolderBase]: 938/4141 cut-off events. [2025-04-30 10:30:28,434 INFO L117 PetriNetUnfolderBase]: For 1437/1633 co-relation queries the response was YES. [2025-04-30 10:30:28,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6917 conditions, 4141 events. 938/4141 cut-off events. For 1437/1633 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 41486 event pairs, 546 based on Foata normal form. 7/3751 useless extension candidates. Maximal degree in co-relation 6583. Up to 1216 conditions per place. [2025-04-30 10:30:28,452 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 28 selfloop transitions, 9 changer transitions 0/136 dead transitions. [2025-04-30 10:30:28,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 136 transitions, 466 flow [2025-04-30 10:30:28,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2025-04-30 10:30:28,454 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9203539823008849 [2025-04-30 10:30:28,454 INFO L175 Difference]: Start difference. First operand has 131 places, 122 transitions, 341 flow. Second operand 3 states and 312 transitions. [2025-04-30 10:30:28,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 136 transitions, 466 flow [2025-04-30 10:30:28,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 136 transitions, 456 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:28,457 INFO L231 Difference]: Finished difference. Result has 132 places, 129 transitions, 407 flow [2025-04-30 10:30:28,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=132, PETRI_TRANSITIONS=129} [2025-04-30 10:30:28,457 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 15 predicate places. [2025-04-30 10:30:28,457 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 129 transitions, 407 flow [2025-04-30 10:30:28,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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-30 10:30:28,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:28,458 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:28,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:30:28,458 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:28,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:28,458 INFO L85 PathProgramCache]: Analyzing trace with hash -835881561, now seen corresponding path program 1 times [2025-04-30 10:30:28,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:28,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507505627] [2025-04-30 10:30:28,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:28,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:28,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:30:28,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:30:28,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:28,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:30:28,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:28,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507505627] [2025-04-30 10:30:28,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507505627] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:28,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:28,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:30:28,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538263919] [2025-04-30 10:30:28,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:28,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:30:28,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:28,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:30:28,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:30:28,626 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2025-04-30 10:30:28,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 129 transitions, 407 flow. Second operand has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 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-30 10:30:28,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:28,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2025-04-30 10:30:28,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:29,157 INFO L116 PetriNetUnfolderBase]: 1210/6294 cut-off events. [2025-04-30 10:30:29,157 INFO L117 PetriNetUnfolderBase]: For 1575/2583 co-relation queries the response was YES. [2025-04-30 10:30:29,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9952 conditions, 6294 events. 1210/6294 cut-off events. For 1575/2583 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 66842 event pairs, 186 based on Foata normal form. 16/5595 useless extension candidates. Maximal degree in co-relation 5342. Up to 927 conditions per place. [2025-04-30 10:30:29,192 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 47 selfloop transitions, 10 changer transitions 0/161 dead transitions. [2025-04-30 10:30:29,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 161 transitions, 589 flow [2025-04-30 10:30:29,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:30:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:30:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 978 transitions. [2025-04-30 10:30:29,194 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8654867256637168 [2025-04-30 10:30:29,194 INFO L175 Difference]: Start difference. First operand has 132 places, 129 transitions, 407 flow. Second operand 10 states and 978 transitions. [2025-04-30 10:30:29,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 161 transitions, 589 flow [2025-04-30 10:30:29,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 161 transitions, 571 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:29,199 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 429 flow [2025-04-30 10:30:29,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=429, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2025-04-30 10:30:29,199 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 25 predicate places. [2025-04-30 10:30:29,199 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 429 flow [2025-04-30 10:30:29,200 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 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-30 10:30:29,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:29,200 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:29,200 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:30:29,200 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:29,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:29,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1292015184, now seen corresponding path program 1 times [2025-04-30 10:30:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:29,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672040243] [2025-04-30 10:30:29,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:29,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:29,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:30:29,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:30:29,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:29,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:30:29,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:29,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672040243] [2025-04-30 10:30:29,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672040243] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:29,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:29,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:30:29,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034439178] [2025-04-30 10:30:29,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:29,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:29,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:29,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:29,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:29,256 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 113 [2025-04-30 10:30:29,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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-30 10:30:29,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:29,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 113 [2025-04-30 10:30:29,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:29,364 INFO L116 PetriNetUnfolderBase]: 98/1375 cut-off events. [2025-04-30 10:30:29,364 INFO L117 PetriNetUnfolderBase]: For 316/360 co-relation queries the response was YES. [2025-04-30 10:30:29,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2026 conditions, 1375 events. 98/1375 cut-off events. For 316/360 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10218 event pairs, 26 based on Foata normal form. 20/1279 useless extension candidates. Maximal degree in co-relation 919. Up to 101 conditions per place. [2025-04-30 10:30:29,370 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 12 selfloop transitions, 6 changer transitions 0/130 dead transitions. [2025-04-30 10:30:29,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 130 transitions, 460 flow [2025-04-30 10:30:29,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2025-04-30 10:30:29,371 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9469026548672567 [2025-04-30 10:30:29,371 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 429 flow. Second operand 3 states and 321 transitions. [2025-04-30 10:30:29,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 130 transitions, 460 flow [2025-04-30 10:30:29,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 130 transitions, 434 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:30:29,373 INFO L231 Difference]: Finished difference. Result has 138 places, 125 transitions, 379 flow [2025-04-30 10:30:29,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=379, PETRI_PLACES=138, PETRI_TRANSITIONS=125} [2025-04-30 10:30:29,374 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 21 predicate places. [2025-04-30 10:30:29,374 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 125 transitions, 379 flow [2025-04-30 10:30:29,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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-30 10:30:29,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:29,374 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:29,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:30:29,374 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:29,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash -332942382, now seen corresponding path program 1 times [2025-04-30 10:30:29,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:29,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98540240] [2025-04-30 10:30:29,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:29,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:29,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:30:29,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:30:29,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:29,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:30:29,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:29,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98540240] [2025-04-30 10:30:29,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98540240] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:29,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:29,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:29,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809575286] [2025-04-30 10:30:29,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:29,404 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:29,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:29,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:29,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:29,417 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 113 [2025-04-30 10:30:29,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 125 transitions, 379 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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-30 10:30:29,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:29,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 113 [2025-04-30 10:30:29,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:29,520 INFO L116 PetriNetUnfolderBase]: 177/1427 cut-off events. [2025-04-30 10:30:29,520 INFO L117 PetriNetUnfolderBase]: For 749/797 co-relation queries the response was YES. [2025-04-30 10:30:29,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 1427 events. 177/1427 cut-off events. For 749/797 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 11053 event pairs, 135 based on Foata normal form. 3/1315 useless extension candidates. Maximal degree in co-relation 2146. Up to 336 conditions per place. [2025-04-30 10:30:29,526 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 23 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2025-04-30 10:30:29,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 130 transitions, 453 flow [2025-04-30 10:30:29,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2025-04-30 10:30:29,528 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8997050147492626 [2025-04-30 10:30:29,528 INFO L175 Difference]: Start difference. First operand has 138 places, 125 transitions, 379 flow. Second operand 3 states and 305 transitions. [2025-04-30 10:30:29,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 130 transitions, 453 flow [2025-04-30 10:30:29,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 130 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:30:29,531 INFO L231 Difference]: Finished difference. Result has 141 places, 128 transitions, 407 flow [2025-04-30 10:30:29,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=141, PETRI_TRANSITIONS=128} [2025-04-30 10:30:29,532 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 24 predicate places. [2025-04-30 10:30:29,532 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 128 transitions, 407 flow [2025-04-30 10:30:29,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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-30 10:30:29,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:29,532 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:29,532 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:30:29,532 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:29,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1510975137, now seen corresponding path program 1 times [2025-04-30 10:30:29,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:29,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658643612] [2025-04-30 10:30:29,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:29,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-30 10:30:29,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-30 10:30:29,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:29,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:29,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:30:29,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:29,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658643612] [2025-04-30 10:30:29,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658643612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:29,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:29,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:30:29,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787592114] [2025-04-30 10:30:29,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:29,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:30:29,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:29,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:30:29,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:30:29,729 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2025-04-30 10:30:29,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 128 transitions, 407 flow. Second operand has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 0 states have call successors, (0), 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-30 10:30:29,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:29,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2025-04-30 10:30:29,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:29,942 INFO L116 PetriNetUnfolderBase]: 151/816 cut-off events. [2025-04-30 10:30:29,942 INFO L117 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-04-30 10:30:29,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 816 events. 151/816 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4776 event pairs, 0 based on Foata normal form. 20/817 useless extension candidates. Maximal degree in co-relation 1481. Up to 88 conditions per place. [2025-04-30 10:30:29,945 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 50 selfloop transitions, 11 changer transitions 0/125 dead transitions. [2025-04-30 10:30:29,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 125 transitions, 498 flow [2025-04-30 10:30:29,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:30:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:30:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1245 transitions. [2025-04-30 10:30:29,948 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8475153165418652 [2025-04-30 10:30:29,948 INFO L175 Difference]: Start difference. First operand has 141 places, 128 transitions, 407 flow. Second operand 13 states and 1245 transitions. [2025-04-30 10:30:29,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 125 transitions, 498 flow [2025-04-30 10:30:29,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 125 transitions, 460 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-04-30 10:30:29,950 INFO L231 Difference]: Finished difference. Result has 112 places, 86 transitions, 246 flow [2025-04-30 10:30:29,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=246, PETRI_PLACES=112, PETRI_TRANSITIONS=86} [2025-04-30 10:30:29,951 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -5 predicate places. [2025-04-30 10:30:29,951 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 86 transitions, 246 flow [2025-04-30 10:30:29,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 0 states have call successors, (0), 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-30 10:30:29,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:29,951 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:29,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:30:29,951 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:29,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash -306173713, now seen corresponding path program 1 times [2025-04-30 10:30:29,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:29,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122841396] [2025-04-30 10:30:29,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:29,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:29,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-30 10:30:29,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-30 10:30:29,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:29,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:29,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:30:29,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-30 10:30:29,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-30 10:30:29,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:29,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:29,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:30:29,985 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:30:29,986 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-30 10:30:29,986 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-04-30 10:30:29,986 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-04-30 10:30:29,986 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-04-30 10:30:29,986 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-04-30 10:30:29,986 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-04-30 10:30:29,986 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-04-30 10:30:29,986 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-04-30 10:30:29,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:30:29,986 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:29,986 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:30:29,986 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-30 10:30:30,009 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-30 10:30:30,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 131 transitions, 302 flow [2025-04-30 10:30:30,052 INFO L116 PetriNetUnfolderBase]: 21/574 cut-off events. [2025-04-30 10:30:30,053 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-30 10:30:30,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 574 events. 21/574 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2161 event pairs, 6 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 353. Up to 32 conditions per place. [2025-04-30 10:30:30,055 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 131 transitions, 302 flow [2025-04-30 10:30:30,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 131 transitions, 302 flow [2025-04-30 10:30:30,059 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:30:30,059 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;@3e5a89ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:30:30,059 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-30 10:30:30,061 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:30:30,061 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-30 10:30:30,061 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:30:30,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:30,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:30,062 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:30,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1401892667, now seen corresponding path program 1 times [2025-04-30 10:30:30,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:30,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6163002] [2025-04-30 10:30:30,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:30,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:30,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:30:30,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:30:30,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:30,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:30,090 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-30 10:30:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:30,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6163002] [2025-04-30 10:30:30,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6163002] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:30,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:30,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:30,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508171245] [2025-04-30 10:30:30,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:30,091 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:30,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:30,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:30,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:30,117 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 131 [2025-04-30 10:30:30,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 131 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 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-30 10:30:30,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:30,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 131 [2025-04-30 10:30:30,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:30,756 INFO L116 PetriNetUnfolderBase]: 2017/8327 cut-off events. [2025-04-30 10:30:30,756 INFO L117 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2025-04-30 10:30:30,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11728 conditions, 8327 events. 2017/8327 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 85606 event pairs, 1191 based on Foata normal form. 1/7616 useless extension candidates. Maximal degree in co-relation 5299. Up to 2119 conditions per place. [2025-04-30 10:30:30,794 INFO L140 encePairwiseOnDemand]: 126/131 looper letters, 30 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2025-04-30 10:30:30,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 142 transitions, 392 flow [2025-04-30 10:30:30,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2025-04-30 10:30:30,795 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8912213740458015 [2025-04-30 10:30:30,795 INFO L175 Difference]: Start difference. First operand has 136 places, 131 transitions, 302 flow. Second operand 4 states and 467 transitions. [2025-04-30 10:30:30,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 142 transitions, 392 flow [2025-04-30 10:30:30,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 142 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:30,797 INFO L231 Difference]: Finished difference. Result has 140 places, 132 transitions, 318 flow [2025-04-30 10:30:30,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=140, PETRI_TRANSITIONS=132} [2025-04-30 10:30:30,797 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 4 predicate places. [2025-04-30 10:30:30,798 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 132 transitions, 318 flow [2025-04-30 10:30:30,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 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-30 10:30:30,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:30,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:30,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-30 10:30:30,798 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:30,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:30,798 INFO L85 PathProgramCache]: Analyzing trace with hash 940845538, now seen corresponding path program 1 times [2025-04-30 10:30:30,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:30,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484949221] [2025-04-30 10:30:30,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:30,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:30,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:30:30,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:30:30,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:30,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:30,911 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-30 10:30:30,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:30,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484949221] [2025-04-30 10:30:30,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484949221] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:30,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:30,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:30,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15448389] [2025-04-30 10:30:30,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:30,912 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:30,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:30,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:30,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:30,984 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 131 [2025-04-30 10:30:30,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 132 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:30,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:30,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 131 [2025-04-30 10:30:30,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:32,151 INFO L116 PetriNetUnfolderBase]: 6248/15894 cut-off events. [2025-04-30 10:30:32,151 INFO L117 PetriNetUnfolderBase]: For 1589/1589 co-relation queries the response was YES. [2025-04-30 10:30:32,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25970 conditions, 15894 events. 6248/15894 cut-off events. For 1589/1589 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 162501 event pairs, 808 based on Foata normal form. 0/14856 useless extension candidates. Maximal degree in co-relation 9040. Up to 6781 conditions per place. [2025-04-30 10:30:32,230 INFO L140 encePairwiseOnDemand]: 125/131 looper letters, 62 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2025-04-30 10:30:32,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 163 transitions, 514 flow [2025-04-30 10:30:32,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2025-04-30 10:30:32,232 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8180661577608143 [2025-04-30 10:30:32,232 INFO L175 Difference]: Start difference. First operand has 140 places, 132 transitions, 318 flow. Second operand 6 states and 643 transitions. [2025-04-30 10:30:32,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 163 transitions, 514 flow [2025-04-30 10:30:32,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 163 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:32,237 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 320 flow [2025-04-30 10:30:32,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2025-04-30 10:30:32,238 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 6 predicate places. [2025-04-30 10:30:32,238 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 320 flow [2025-04-30 10:30:32,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:32,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:32,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:32,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-30 10:30:32,238 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:32,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1657327178, now seen corresponding path program 1 times [2025-04-30 10:30:32,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:32,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471046381] [2025-04-30 10:30:32,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:32,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:32,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:30:32,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:30:32,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:32,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:32,255 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-30 10:30:32,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:32,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471046381] [2025-04-30 10:30:32,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471046381] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:32,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:32,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:32,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505448278] [2025-04-30 10:30:32,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:32,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:32,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:32,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:32,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:32,270 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:32,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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-30 10:30:32,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:32,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:32,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:34,279 INFO L116 PetriNetUnfolderBase]: 7178/23603 cut-off events. [2025-04-30 10:30:34,279 INFO L117 PetriNetUnfolderBase]: For 5188/6430 co-relation queries the response was YES. [2025-04-30 10:30:34,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35693 conditions, 23603 events. 7178/23603 cut-off events. For 5188/6430 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 286837 event pairs, 4486 based on Foata normal form. 11/20852 useless extension candidates. Maximal degree in co-relation 12989. Up to 8464 conditions per place. [2025-04-30 10:30:34,456 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 36 selfloop transitions, 7 changer transitions 0/149 dead transitions. [2025-04-30 10:30:34,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 149 transitions, 472 flow [2025-04-30 10:30:34,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2025-04-30 10:30:34,459 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9211195928753181 [2025-04-30 10:30:34,459 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 320 flow. Second operand 3 states and 362 transitions. [2025-04-30 10:30:34,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 149 transitions, 472 flow [2025-04-30 10:30:34,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 149 transitions, 462 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:30:34,462 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 364 flow [2025-04-30 10:30:34,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2025-04-30 10:30:34,462 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 5 predicate places. [2025-04-30 10:30:34,464 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 364 flow [2025-04-30 10:30:34,464 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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-30 10:30:34,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:34,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:34,464 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-30 10:30:34,465 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:34,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:34,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1196376866, now seen corresponding path program 1 times [2025-04-30 10:30:34,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:34,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487941476] [2025-04-30 10:30:34,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:34,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:34,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:30:34,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:30:34,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:34,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:34,497 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-30 10:30:34,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:34,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487941476] [2025-04-30 10:30:34,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487941476] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:34,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:34,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:34,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037101382] [2025-04-30 10:30:34,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:34,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:34,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:34,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:34,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:34,521 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 131 [2025-04-30 10:30:34,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 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-30 10:30:34,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:34,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 131 [2025-04-30 10:30:34,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:36,118 INFO L116 PetriNetUnfolderBase]: 5437/19811 cut-off events. [2025-04-30 10:30:36,119 INFO L117 PetriNetUnfolderBase]: For 2732/2798 co-relation queries the response was YES. [2025-04-30 10:30:36,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30233 conditions, 19811 events. 5437/19811 cut-off events. For 2732/2798 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 241661 event pairs, 2945 based on Foata normal form. 259/17673 useless extension candidates. Maximal degree in co-relation 24434. Up to 3835 conditions per place. [2025-04-30 10:30:36,257 INFO L140 encePairwiseOnDemand]: 126/131 looper letters, 40 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2025-04-30 10:30:36,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 158 transitions, 506 flow [2025-04-30 10:30:36,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2025-04-30 10:30:36,258 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9103053435114504 [2025-04-30 10:30:36,259 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 364 flow. Second operand 4 states and 477 transitions. [2025-04-30 10:30:36,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 158 transitions, 506 flow [2025-04-30 10:30:36,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 158 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:36,269 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 366 flow [2025-04-30 10:30:36,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=143, PETRI_TRANSITIONS=138} [2025-04-30 10:30:36,270 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 7 predicate places. [2025-04-30 10:30:36,270 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 366 flow [2025-04-30 10:30:36,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 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-30 10:30:36,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:36,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:36,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-30 10:30:36,271 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:36,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:36,271 INFO L85 PathProgramCache]: Analyzing trace with hash 221013424, now seen corresponding path program 1 times [2025-04-30 10:30:36,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:36,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103009989] [2025-04-30 10:30:36,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:36,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:36,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:30:36,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:30:36,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:36,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:36,433 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-30 10:30:36,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:36,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103009989] [2025-04-30 10:30:36,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103009989] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:36,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:36,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:30:36,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351576011] [2025-04-30 10:30:36,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:36,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:36,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:36,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:36,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:36,481 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:36,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 138 transitions, 366 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 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-30 10:30:36,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:36,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:36,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:38,640 INFO L116 PetriNetUnfolderBase]: 6308/24158 cut-off events. [2025-04-30 10:30:38,640 INFO L117 PetriNetUnfolderBase]: For 3185/3185 co-relation queries the response was YES. [2025-04-30 10:30:38,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36542 conditions, 24158 events. 6308/24158 cut-off events. For 3185/3185 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 309828 event pairs, 2802 based on Foata normal form. 3/20930 useless extension candidates. Maximal degree in co-relation 20572. Up to 5820 conditions per place. [2025-04-30 10:30:38,870 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 41 selfloop transitions, 7 changer transitions 0/160 dead transitions. [2025-04-30 10:30:38,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 160 transitions, 508 flow [2025-04-30 10:30:38,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:30:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:30:38,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 791 transitions. [2025-04-30 10:30:38,872 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8625954198473282 [2025-04-30 10:30:38,872 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 366 flow. Second operand 7 states and 791 transitions. [2025-04-30 10:30:38,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 160 transitions, 508 flow [2025-04-30 10:30:38,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 160 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:38,880 INFO L231 Difference]: Finished difference. Result has 150 places, 141 transitions, 396 flow [2025-04-30 10:30:38,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=396, PETRI_PLACES=150, PETRI_TRANSITIONS=141} [2025-04-30 10:30:38,881 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 14 predicate places. [2025-04-30 10:30:38,881 INFO L485 AbstractCegarLoop]: Abstraction has has 150 places, 141 transitions, 396 flow [2025-04-30 10:30:38,881 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 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-30 10:30:38,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:38,882 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:38,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-30 10:30:38,882 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:38,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:38,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1427955564, now seen corresponding path program 1 times [2025-04-30 10:30:38,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:38,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793502844] [2025-04-30 10:30:38,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:38,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:38,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:30:38,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:30:38,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:38,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:38,907 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-30 10:30:38,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:38,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793502844] [2025-04-30 10:30:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793502844] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:38,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:38,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496880473] [2025-04-30 10:30:38,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:38,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:38,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:38,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:38,923 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:38,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 141 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-30 10:30:38,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:38,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:38,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:41,789 INFO L116 PetriNetUnfolderBase]: 8620/31172 cut-off events. [2025-04-30 10:30:41,789 INFO L117 PetriNetUnfolderBase]: For 11338/13559 co-relation queries the response was YES. [2025-04-30 10:30:41,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52388 conditions, 31172 events. 8620/31172 cut-off events. For 11338/13559 co-relation queries the response was YES. Maximal size of possible extension queue 1070. Compared 411118 event pairs, 4986 based on Foata normal form. 43/27821 useless extension candidates. Maximal degree in co-relation 51105. Up to 9839 conditions per place. [2025-04-30 10:30:42,021 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 38 selfloop transitions, 11 changer transitions 0/161 dead transitions. [2025-04-30 10:30:42,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 161 transitions, 573 flow [2025-04-30 10:30:42,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-04-30 10:30:42,022 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9185750636132316 [2025-04-30 10:30:42,022 INFO L175 Difference]: Start difference. First operand has 150 places, 141 transitions, 396 flow. Second operand 3 states and 361 transitions. [2025-04-30 10:30:42,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 161 transitions, 573 flow [2025-04-30 10:30:42,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 161 transitions, 563 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:42,047 INFO L231 Difference]: Finished difference. Result has 151 places, 150 transitions, 482 flow [2025-04-30 10:30:42,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=151, PETRI_TRANSITIONS=150} [2025-04-30 10:30:42,047 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 15 predicate places. [2025-04-30 10:30:42,047 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 150 transitions, 482 flow [2025-04-30 10:30:42,048 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-30 10:30:42,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:42,048 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:42,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-30 10:30:42,048 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:42,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:42,048 INFO L85 PathProgramCache]: Analyzing trace with hash 299379018, now seen corresponding path program 1 times [2025-04-30 10:30:42,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:42,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253497469] [2025-04-30 10:30:42,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:42,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:42,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:30:42,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:30:42,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:42,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:42,128 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-30 10:30:42,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:42,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253497469] [2025-04-30 10:30:42,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253497469] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:42,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:42,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:30:42,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724364567] [2025-04-30 10:30:42,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:42,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:30:42,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:42,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:30:42,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:30:42,199 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:42,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 150 transitions, 482 flow. Second operand has 8 states, 8 states have (on average 107.625) internal successors, (861), 8 states have internal predecessors, (861), 0 states have call successors, (0), 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-30 10:30:42,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:42,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:42,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:45,897 INFO L116 PetriNetUnfolderBase]: 9234/37130 cut-off events. [2025-04-30 10:30:45,897 INFO L117 PetriNetUnfolderBase]: For 10531/21435 co-relation queries the response was YES. [2025-04-30 10:30:46,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60596 conditions, 37130 events. 9234/37130 cut-off events. For 10531/21435 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 515189 event pairs, 2450 based on Foata normal form. 33/32098 useless extension candidates. Maximal degree in co-relation 28374. Up to 8114 conditions per place. [2025-04-30 10:30:46,251 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 55 selfloop transitions, 10 changer transitions 0/186 dead transitions. [2025-04-30 10:30:46,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 186 transitions, 694 flow [2025-04-30 10:30:46,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:30:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:30:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1126 transitions. [2025-04-30 10:30:46,252 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8595419847328244 [2025-04-30 10:30:46,252 INFO L175 Difference]: Start difference. First operand has 151 places, 150 transitions, 482 flow. Second operand 10 states and 1126 transitions. [2025-04-30 10:30:46,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 186 transitions, 694 flow [2025-04-30 10:30:46,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 186 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:46,288 INFO L231 Difference]: Finished difference. Result has 161 places, 153 transitions, 508 flow [2025-04-30 10:30:46,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=508, PETRI_PLACES=161, PETRI_TRANSITIONS=153} [2025-04-30 10:30:46,289 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 25 predicate places. [2025-04-30 10:30:46,289 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 153 transitions, 508 flow [2025-04-30 10:30:46,289 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.625) internal successors, (861), 8 states have internal predecessors, (861), 0 states have call successors, (0), 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-30 10:30:46,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:46,290 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:46,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-30 10:30:46,290 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:46,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:46,290 INFO L85 PathProgramCache]: Analyzing trace with hash 311102176, now seen corresponding path program 1 times [2025-04-30 10:30:46,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:46,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108293532] [2025-04-30 10:30:46,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:46,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:46,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:30:46,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:30:46,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:46,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:46,340 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-30 10:30:46,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:46,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108293532] [2025-04-30 10:30:46,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108293532] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:46,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:46,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:30:46,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191631836] [2025-04-30 10:30:46,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:46,341 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:46,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:46,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:46,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:46,349 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 131 [2025-04-30 10:30:46,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 153 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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-30 10:30:46,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:46,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 131 [2025-04-30 10:30:46,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:46,850 INFO L116 PetriNetUnfolderBase]: 531/5139 cut-off events. [2025-04-30 10:30:46,850 INFO L117 PetriNetUnfolderBase]: For 1397/1576 co-relation queries the response was YES. [2025-04-30 10:30:46,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7676 conditions, 5139 events. 531/5139 cut-off events. For 1397/1576 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 55689 event pairs, 193 based on Foata normal form. 140/4810 useless extension candidates. Maximal degree in co-relation 3626. Up to 422 conditions per place. [2025-04-30 10:30:46,880 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 16 selfloop transitions, 8 changer transitions 0/151 dead transitions. [2025-04-30 10:30:46,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 151 transitions, 549 flow [2025-04-30 10:30:46,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2025-04-30 10:30:46,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9414758269720102 [2025-04-30 10:30:46,883 INFO L175 Difference]: Start difference. First operand has 161 places, 153 transitions, 508 flow. Second operand 3 states and 370 transitions. [2025-04-30 10:30:46,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 151 transitions, 549 flow [2025-04-30 10:30:46,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 151 transitions, 523 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:30:46,888 INFO L231 Difference]: Finished difference. Result has 157 places, 144 transitions, 444 flow [2025-04-30 10:30:46,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=157, PETRI_TRANSITIONS=144} [2025-04-30 10:30:46,889 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 21 predicate places. [2025-04-30 10:30:46,889 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 144 transitions, 444 flow [2025-04-30 10:30:46,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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-30 10:30:46,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:46,889 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:46,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-30 10:30:46,889 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:46,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:46,890 INFO L85 PathProgramCache]: Analyzing trace with hash 539356037, now seen corresponding path program 1 times [2025-04-30 10:30:46,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:46,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145494883] [2025-04-30 10:30:46,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:46,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:46,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:30:46,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:30:46,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:46,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:46,922 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-30 10:30:46,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:46,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145494883] [2025-04-30 10:30:46,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145494883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:46,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:46,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:46,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073007135] [2025-04-30 10:30:46,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:46,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:46,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:46,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:46,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:46,938 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:46,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 144 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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-30 10:30:46,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:46,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:46,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:47,623 INFO L116 PetriNetUnfolderBase]: 934/6027 cut-off events. [2025-04-30 10:30:47,624 INFO L117 PetriNetUnfolderBase]: For 3693/3795 co-relation queries the response was YES. [2025-04-30 10:30:47,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10594 conditions, 6027 events. 934/6027 cut-off events. For 3693/3795 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 68524 event pairs, 666 based on Foata normal form. 4/5496 useless extension candidates. Maximal degree in co-relation 3854. Up to 1548 conditions per place. [2025-04-30 10:30:47,652 INFO L140 encePairwiseOnDemand]: 126/131 looper letters, 30 selfloop transitions, 4 changer transitions 0/151 dead transitions. [2025-04-30 10:30:47,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 151 transitions, 548 flow [2025-04-30 10:30:47,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2025-04-30 10:30:47,653 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8931297709923665 [2025-04-30 10:30:47,653 INFO L175 Difference]: Start difference. First operand has 157 places, 144 transitions, 444 flow. Second operand 3 states and 351 transitions. [2025-04-30 10:30:47,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 151 transitions, 548 flow [2025-04-30 10:30:47,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 151 transitions, 540 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:30:47,657 INFO L231 Difference]: Finished difference. Result has 160 places, 147 transitions, 470 flow [2025-04-30 10:30:47,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=160, PETRI_TRANSITIONS=147} [2025-04-30 10:30:47,657 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 24 predicate places. [2025-04-30 10:30:47,657 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 147 transitions, 470 flow [2025-04-30 10:30:47,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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-30 10:30:47,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:47,657 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:47,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-30 10:30:47,658 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:47,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:47,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1211542257, now seen corresponding path program 1 times [2025-04-30 10:30:47,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:47,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057291888] [2025-04-30 10:30:47,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:47,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:47,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-30 10:30:47,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-30 10:30:47,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:47,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:47,758 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-30 10:30:47,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:47,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057291888] [2025-04-30 10:30:47,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057291888] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:47,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:47,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:30:47,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347735630] [2025-04-30 10:30:47,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:47,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:30:47,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:47,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:30:47,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:30:47,826 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 131 [2025-04-30 10:30:47,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 147 transitions, 470 flow. Second operand has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 0 states have call successors, (0), 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-30 10:30:47,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:47,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 131 [2025-04-30 10:30:47,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:48,704 INFO L116 PetriNetUnfolderBase]: 1216/8418 cut-off events. [2025-04-30 10:30:48,704 INFO L117 PetriNetUnfolderBase]: For 3392/3658 co-relation queries the response was YES. [2025-04-30 10:30:48,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13831 conditions, 8418 events. 1216/8418 cut-off events. For 3392/3658 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 91367 event pairs, 207 based on Foata normal form. 20/7681 useless extension candidates. Maximal degree in co-relation 5591. Up to 893 conditions per place. [2025-04-30 10:30:48,753 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 76 selfloop transitions, 14 changer transitions 1/205 dead transitions. [2025-04-30 10:30:48,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 205 transitions, 828 flow [2025-04-30 10:30:48,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:30:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:30:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1457 transitions. [2025-04-30 10:30:48,755 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8555490311215502 [2025-04-30 10:30:48,755 INFO L175 Difference]: Start difference. First operand has 160 places, 147 transitions, 470 flow. Second operand 13 states and 1457 transitions. [2025-04-30 10:30:48,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 205 transitions, 828 flow [2025-04-30 10:30:48,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 205 transitions, 816 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:48,763 INFO L231 Difference]: Finished difference. Result has 174 places, 150 transitions, 520 flow [2025-04-30 10:30:48,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=520, PETRI_PLACES=174, PETRI_TRANSITIONS=150} [2025-04-30 10:30:48,763 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 38 predicate places. [2025-04-30 10:30:48,763 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 150 transitions, 520 flow [2025-04-30 10:30:48,764 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 0 states have call successors, (0), 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-30 10:30:48,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:48,764 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:48,764 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-30 10:30:48,764 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:48,765 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:48,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1399660987, now seen corresponding path program 1 times [2025-04-30 10:30:48,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:48,765 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656029277] [2025-04-30 10:30:48,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:48,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-04-30 10:30:48,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-04-30 10:30:48,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:48,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:48,791 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-30 10:30:48,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:48,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656029277] [2025-04-30 10:30:48,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656029277] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:48,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:48,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:48,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826619420] [2025-04-30 10:30:48,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:48,792 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:48,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:48,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:48,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:48,807 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:48,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 150 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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-30 10:30:48,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:48,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:48,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:49,274 INFO L116 PetriNetUnfolderBase]: 883/5710 cut-off events. [2025-04-30 10:30:49,274 INFO L117 PetriNetUnfolderBase]: For 4093/4189 co-relation queries the response was YES. [2025-04-30 10:30:49,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10588 conditions, 5710 events. 883/5710 cut-off events. For 4093/4189 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 62487 event pairs, 677 based on Foata normal form. 4/5205 useless extension candidates. Maximal degree in co-relation 9769. Up to 1476 conditions per place. [2025-04-30 10:30:49,311 INFO L140 encePairwiseOnDemand]: 126/131 looper letters, 30 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2025-04-30 10:30:49,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 156 transitions, 615 flow [2025-04-30 10:30:49,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2025-04-30 10:30:49,312 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8905852417302799 [2025-04-30 10:30:49,312 INFO L175 Difference]: Start difference. First operand has 174 places, 150 transitions, 520 flow. Second operand 3 states and 350 transitions. [2025-04-30 10:30:49,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 156 transitions, 615 flow [2025-04-30 10:30:49,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 156 transitions, 585 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-04-30 10:30:49,321 INFO L231 Difference]: Finished difference. Result has 170 places, 153 transitions, 526 flow [2025-04-30 10:30:49,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=170, PETRI_TRANSITIONS=153} [2025-04-30 10:30:49,321 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 34 predicate places. [2025-04-30 10:30:49,322 INFO L485 AbstractCegarLoop]: Abstraction has has 170 places, 153 transitions, 526 flow [2025-04-30 10:30:49,322 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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-30 10:30:49,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:49,322 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:49,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-30 10:30:49,322 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:49,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:49,323 INFO L85 PathProgramCache]: Analyzing trace with hash -396449237, now seen corresponding path program 1 times [2025-04-30 10:30:49,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:49,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60825005] [2025-04-30 10:30:49,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:49,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:49,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-30 10:30:49,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-30 10:30:49,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:49,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:49,499 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-30 10:30:49,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:49,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60825005] [2025-04-30 10:30:49,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60825005] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:49,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:49,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:49,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63334687] [2025-04-30 10:30:49,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:49,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:49,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:49,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:49,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:49,568 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 131 [2025-04-30 10:30:49,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 153 transitions, 526 flow. Second operand has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 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-30 10:30:49,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:49,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 131 [2025-04-30 10:30:49,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:50,761 INFO L116 PetriNetUnfolderBase]: 2726/11410 cut-off events. [2025-04-30 10:30:50,761 INFO L117 PetriNetUnfolderBase]: For 4376/4680 co-relation queries the response was YES. [2025-04-30 10:30:50,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21748 conditions, 11410 events. 2726/11410 cut-off events. For 4376/4680 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 124819 event pairs, 1342 based on Foata normal form. 0/10706 useless extension candidates. Maximal degree in co-relation 19455. Up to 2509 conditions per place. [2025-04-30 10:30:50,814 INFO L140 encePairwiseOnDemand]: 125/131 looper letters, 59 selfloop transitions, 6 changer transitions 0/184 dead transitions. [2025-04-30 10:30:50,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 184 transitions, 750 flow [2025-04-30 10:30:50,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:50,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2025-04-30 10:30:50,815 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8307888040712468 [2025-04-30 10:30:50,815 INFO L175 Difference]: Start difference. First operand has 170 places, 153 transitions, 526 flow. Second operand 6 states and 653 transitions. [2025-04-30 10:30:50,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 184 transitions, 750 flow [2025-04-30 10:30:50,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 184 transitions, 736 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:50,834 INFO L231 Difference]: Finished difference. Result has 172 places, 152 transitions, 522 flow [2025-04-30 10:30:50,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=172, PETRI_TRANSITIONS=152} [2025-04-30 10:30:50,835 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 36 predicate places. [2025-04-30 10:30:50,835 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 152 transitions, 522 flow [2025-04-30 10:30:50,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 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-30 10:30:50,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:50,835 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:50,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-30 10:30:50,835 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:50,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash 693212984, now seen corresponding path program 1 times [2025-04-30 10:30:50,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:50,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774032193] [2025-04-30 10:30:50,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:50,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:50,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-04-30 10:30:50,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-04-30 10:30:50,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:50,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:50,986 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-30 10:30:50,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:50,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774032193] [2025-04-30 10:30:50,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774032193] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:50,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:50,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-30 10:30:50,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962572066] [2025-04-30 10:30:50,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:50,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:30:50,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:50,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:30:50,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:30:51,098 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 131 [2025-04-30 10:30:51,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 152 transitions, 522 flow. Second operand has 12 states, 12 states have (on average 107.0) internal successors, (1284), 12 states have internal predecessors, (1284), 0 states have call successors, (0), 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-30 10:30:51,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:51,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 131 [2025-04-30 10:30:51,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:52,244 INFO L116 PetriNetUnfolderBase]: 1190/7818 cut-off events. [2025-04-30 10:30:52,244 INFO L117 PetriNetUnfolderBase]: For 4028/4256 co-relation queries the response was YES. [2025-04-30 10:30:52,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14600 conditions, 7818 events. 1190/7818 cut-off events. For 4028/4256 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 83866 event pairs, 165 based on Foata normal form. 48/7298 useless extension candidates. Maximal degree in co-relation 5054. Up to 557 conditions per place. [2025-04-30 10:30:52,269 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 90 selfloop transitions, 16 changer transitions 8/229 dead transitions. [2025-04-30 10:30:52,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 229 transitions, 978 flow [2025-04-30 10:30:52,269 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:30:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-30 10:30:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1795 transitions. [2025-04-30 10:30:52,270 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8563931297709924 [2025-04-30 10:30:52,271 INFO L175 Difference]: Start difference. First operand has 172 places, 152 transitions, 522 flow. Second operand 16 states and 1795 transitions. [2025-04-30 10:30:52,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 229 transitions, 978 flow [2025-04-30 10:30:52,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 229 transitions, 958 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-30 10:30:52,278 INFO L231 Difference]: Finished difference. Result has 178 places, 150 transitions, 522 flow [2025-04-30 10:30:52,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=522, PETRI_PLACES=178, PETRI_TRANSITIONS=150} [2025-04-30 10:30:52,278 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 42 predicate places. [2025-04-30 10:30:52,278 INFO L485 AbstractCegarLoop]: Abstraction has has 178 places, 150 transitions, 522 flow [2025-04-30 10:30:52,279 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.0) internal successors, (1284), 12 states have internal predecessors, (1284), 0 states have call successors, (0), 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-30 10:30:52,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:52,279 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:52,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-30 10:30:52,279 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:52,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:52,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1426205106, now seen corresponding path program 1 times [2025-04-30 10:30:52,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:52,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78222811] [2025-04-30 10:30:52,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:52,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:52,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-30 10:30:52,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-30 10:30:52,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:52,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:52,303 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-30 10:30:52,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:52,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78222811] [2025-04-30 10:30:52,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78222811] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:52,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:52,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:52,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853332259] [2025-04-30 10:30:52,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:52,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:52,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:52,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:52,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:52,316 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 131 [2025-04-30 10:30:52,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 150 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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-30 10:30:52,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:52,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 131 [2025-04-30 10:30:52,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:52,967 INFO L116 PetriNetUnfolderBase]: 1353/8934 cut-off events. [2025-04-30 10:30:52,967 INFO L117 PetriNetUnfolderBase]: For 5201/5285 co-relation queries the response was YES. [2025-04-30 10:30:53,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16800 conditions, 8934 events. 1353/8934 cut-off events. For 5201/5285 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 106508 event pairs, 605 based on Foata normal form. 0/8374 useless extension candidates. Maximal degree in co-relation 16013. Up to 1591 conditions per place. [2025-04-30 10:30:53,020 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 30 selfloop transitions, 9 changer transitions 1/163 dead transitions. [2025-04-30 10:30:53,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 163 transitions, 656 flow [2025-04-30 10:30:53,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-04-30 10:30:53,020 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9185750636132316 [2025-04-30 10:30:53,020 INFO L175 Difference]: Start difference. First operand has 178 places, 150 transitions, 522 flow. Second operand 3 states and 361 transitions. [2025-04-30 10:30:53,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 163 transitions, 656 flow [2025-04-30 10:30:53,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 163 transitions, 588 flow, removed 6 selfloop flow, removed 21 redundant places. [2025-04-30 10:30:53,052 INFO L231 Difference]: Finished difference. Result has 161 places, 154 transitions, 530 flow [2025-04-30 10:30:53,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=161, PETRI_TRANSITIONS=154} [2025-04-30 10:30:53,052 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 25 predicate places. [2025-04-30 10:30:53,052 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 154 transitions, 530 flow [2025-04-30 10:30:53,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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-30 10:30:53,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:53,053 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:53,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-30 10:30:53,053 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:53,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1139614465, now seen corresponding path program 1 times [2025-04-30 10:30:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:53,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322473240] [2025-04-30 10:30:53,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:53,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:53,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-04-30 10:30:53,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-04-30 10:30:53,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:53,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:53,124 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-30 10:30:53,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:53,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322473240] [2025-04-30 10:30:53,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322473240] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:53,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:53,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:30:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445188039] [2025-04-30 10:30:53,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:53,125 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:53,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:53,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:53,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:53,168 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:53,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 154 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 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-30 10:30:53,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:53,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:53,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:53,811 INFO L116 PetriNetUnfolderBase]: 1110/5875 cut-off events. [2025-04-30 10:30:53,811 INFO L117 PetriNetUnfolderBase]: For 3310/3506 co-relation queries the response was YES. [2025-04-30 10:30:53,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10999 conditions, 5875 events. 1110/5875 cut-off events. For 3310/3506 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 59144 event pairs, 310 based on Foata normal form. 80/5835 useless extension candidates. Maximal degree in co-relation 10335. Up to 748 conditions per place. [2025-04-30 10:30:53,844 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 63 selfloop transitions, 7 changer transitions 8/206 dead transitions. [2025-04-30 10:30:53,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 206 transitions, 852 flow [2025-04-30 10:30:53,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:30:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:30:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2025-04-30 10:30:53,846 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8953107960741549 [2025-04-30 10:30:53,846 INFO L175 Difference]: Start difference. First operand has 161 places, 154 transitions, 530 flow. Second operand 7 states and 821 transitions. [2025-04-30 10:30:53,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 206 transitions, 852 flow [2025-04-30 10:30:53,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 206 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:53,854 INFO L231 Difference]: Finished difference. Result has 168 places, 157 transitions, 548 flow [2025-04-30 10:30:53,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=548, PETRI_PLACES=168, PETRI_TRANSITIONS=157} [2025-04-30 10:30:53,854 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 32 predicate places. [2025-04-30 10:30:53,854 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 157 transitions, 548 flow [2025-04-30 10:30:53,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 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-30 10:30:53,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:53,854 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:53,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-30 10:30:53,855 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:53,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:53,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1800725741, now seen corresponding path program 1 times [2025-04-30 10:30:53,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:53,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887531116] [2025-04-30 10:30:53,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:53,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:53,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-04-30 10:30:53,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-04-30 10:30:53,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:53,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:53,996 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-30 10:30:53,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:53,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887531116] [2025-04-30 10:30:53,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887531116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:53,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:53,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:30:53,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338144779] [2025-04-30 10:30:53,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:53,999 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:30:53,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:54,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:30:54,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:30:54,080 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:54,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 157 transitions, 548 flow. Second operand has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 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-30 10:30:54,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:54,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:54,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:54,621 INFO L116 PetriNetUnfolderBase]: 834/3907 cut-off events. [2025-04-30 10:30:54,621 INFO L117 PetriNetUnfolderBase]: For 2146/2174 co-relation queries the response was YES. [2025-04-30 10:30:54,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7629 conditions, 3907 events. 834/3907 cut-off events. For 2146/2174 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 33589 event pairs, 83 based on Foata normal form. 48/3919 useless extension candidates. Maximal degree in co-relation 6961. Up to 410 conditions per place. [2025-04-30 10:30:54,644 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 85 selfloop transitions, 10 changer transitions 22/237 dead transitions. [2025-04-30 10:30:54,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 237 transitions, 1030 flow [2025-04-30 10:30:54,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:30:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:30:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1170 transitions. [2025-04-30 10:30:54,646 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8931297709923665 [2025-04-30 10:30:54,646 INFO L175 Difference]: Start difference. First operand has 168 places, 157 transitions, 548 flow. Second operand 10 states and 1170 transitions. [2025-04-30 10:30:54,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 237 transitions, 1030 flow [2025-04-30 10:30:54,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 237 transitions, 1020 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:54,653 INFO L231 Difference]: Finished difference. Result has 177 places, 151 transitions, 546 flow [2025-04-30 10:30:54,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=546, PETRI_PLACES=177, PETRI_TRANSITIONS=151} [2025-04-30 10:30:54,654 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 41 predicate places. [2025-04-30 10:30:54,654 INFO L485 AbstractCegarLoop]: Abstraction has has 177 places, 151 transitions, 546 flow [2025-04-30 10:30:54,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 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-30 10:30:54,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:54,654 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:30:54,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-30 10:30:54,654 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:54,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1172499342, now seen corresponding path program 1 times [2025-04-30 10:30:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:54,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888258641] [2025-04-30 10:30:54,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:54,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-04-30 10:30:54,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-04-30 10:30:54,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:54,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:54,843 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-30 10:30:54,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:54,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888258641] [2025-04-30 10:30:54,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888258641] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:54,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:54,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:30:54,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805019364] [2025-04-30 10:30:54,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:54,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:30:54,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:54,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:30:54,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:30:54,913 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 131 [2025-04-30 10:30:54,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 151 transitions, 546 flow. Second operand has 10 states, 10 states have (on average 108.1) internal successors, (1081), 10 states have internal predecessors, (1081), 0 states have call successors, (0), 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-30 10:30:54,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:54,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 131 [2025-04-30 10:30:54,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:55,526 INFO L116 PetriNetUnfolderBase]: 1014/3788 cut-off events. [2025-04-30 10:30:55,526 INFO L117 PetriNetUnfolderBase]: For 2345/2345 co-relation queries the response was YES. [2025-04-30 10:30:55,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8064 conditions, 3788 events. 1014/3788 cut-off events. For 2345/2345 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 32080 event pairs, 71 based on Foata normal form. 12/3776 useless extension candidates. Maximal degree in co-relation 7393. Up to 496 conditions per place. [2025-04-30 10:30:55,545 INFO L140 encePairwiseOnDemand]: 125/131 looper letters, 0 selfloop transitions, 0 changer transitions 224/224 dead transitions. [2025-04-30 10:30:55,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 224 transitions, 981 flow [2025-04-30 10:30:55,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:30:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:30:55,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1491 transitions. [2025-04-30 10:30:55,546 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8755137991779213 [2025-04-30 10:30:55,546 INFO L175 Difference]: Start difference. First operand has 177 places, 151 transitions, 546 flow. Second operand 13 states and 1491 transitions. [2025-04-30 10:30:55,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 224 transitions, 981 flow [2025-04-30 10:30:55,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 224 transitions, 911 flow, removed 18 selfloop flow, removed 18 redundant places. [2025-04-30 10:30:55,555 INFO L231 Difference]: Finished difference. Result has 155 places, 0 transitions, 0 flow [2025-04-30 10:30:55,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=155, PETRI_TRANSITIONS=0} [2025-04-30 10:30:55,555 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 19 predicate places. [2025-04-30 10:30:55,555 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 0 transitions, 0 flow [2025-04-30 10:30:55,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.1) internal successors, (1081), 10 states have internal predecessors, (1081), 0 states have call successors, (0), 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-30 10:30:55,558 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-04-30 10:30:55,558 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-04-30 10:30:55,558 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-04-30 10:30:55,558 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2025-04-30 10:30:55,558 INFO L790 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-04-30 10:30:55,558 INFO L790 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-04-30 10:30:55,558 INFO L790 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-04-30 10:30:55,558 INFO L790 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-04-30 10:30:55,558 INFO L790 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-04-30 10:30:55,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-30 10:30:55,558 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:55,561 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2025-04-30 10:30:55,561 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:30:55,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:30:55 BasicIcfg [2025-04-30 10:30:55,567 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:30:55,568 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:30:55,568 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:30:55,568 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:30:55,569 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:30:22" (3/4) ... [2025-04-30 10:30:55,573 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:30:55,576 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread [2025-04-30 10:30:55,579 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-04-30 10:30:55,580 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:30:55,580 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:30:55,630 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:30:55,631 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:30:55,631 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:30:55,631 INFO L158 Benchmark]: Toolchain (without parser) took 33830.07ms. Allocated memory was 167.8MB in the beginning and 7.4GB in the end (delta: 7.3GB). Free memory was 132.5MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2025-04-30 10:30:55,631 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:30:55,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.51ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 110.1MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:30:55,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.01ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:30:55,632 INFO L158 Benchmark]: Boogie Preprocessor took 19.40ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 106.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:30:55,632 INFO L158 Benchmark]: RCFGBuilder took 274.06ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 92.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:30:55,632 INFO L158 Benchmark]: TraceAbstraction took 33034.93ms. Allocated memory was 167.8MB in the beginning and 7.4GB in the end (delta: 7.3GB). Free memory was 91.3MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2025-04-30 10:30:55,632 INFO L158 Benchmark]: Witness Printer took 62.82ms. Allocated memory is still 7.4GB. Free memory was 4.5GB in the beginning and 4.5GB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:30:55,633 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.89ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.51ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 110.1MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.01ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.40ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 106.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 274.06ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 92.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33034.93ms. Allocated memory was 167.8MB in the beginning and 7.4GB in the end (delta: 7.3GB). Free memory was 91.3MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Witness Printer took 62.82ms. Allocated memory is still 7.4GB. Free memory was 4.5GB in the beginning and 4.5GB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 698]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 696]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 693]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 685]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 94 locations, 95 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 265 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 349 IncrementalHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 10 mSDtfsCounter, 349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 111 locations, 113 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 453 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 308 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 673 IncrementalHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 38 mSDtfsCounter, 673 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=6, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 128 locations, 131 edges, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.1s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 777 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 572 mSDsluCounter, 192 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1149 IncrementalHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 68 mSDtfsCounter, 1149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=7, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 1292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 13/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 145 locations, 149 edges, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.5s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1843 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1482 mSDsluCounter, 392 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 285 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3245 IncrementalHoareTripleChecker+Invalid, 3284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 107 mSDtfsCounter, 3245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=548occurred in iteration=15, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1325 NumberOfCodeBlocks, 1325 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1308 ConstructedInterpolants, 0 QuantifiedInterpolants, 3646 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 20/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:30:55,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE