./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.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/goblint-regression/09-regions_13-arraycollapse_nr.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 b018c23c1a90f89310fc4f08bf16b02660af5a398ccd47f63d319e7a234c112b --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:27:39,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:27:39,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:27:39,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:27:39,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:27:39,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:27:39,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:27:39,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:27:39,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:27:39,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:27:39,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:27:39,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:27:39,981 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:27:39,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:27:39,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:27:39,981 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:27:39,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:27:39,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:27:39,982 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:39,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:27:39,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:27:39,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:39,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:27:39,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:27:39,985 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:27:39,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:27:39,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:27:39,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:27:39,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:27:39,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:27:39,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:27:39,986 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 -> b018c23c1a90f89310fc4f08bf16b02660af5a398ccd47f63d319e7a234c112b [2025-04-30 10:27:40,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:27:40,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:27:40,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:27:40,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:27:40,206 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:27:40,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-04-30 10:27:41,422 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448b2dff7/12eb58a4008844c198d2187357573c87/FLAG512687276 [2025-04-30 10:27:41,711 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:27:41,713 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-04-30 10:27:41,730 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448b2dff7/12eb58a4008844c198d2187357573c87/FLAG512687276 [2025-04-30 10:27:42,472 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448b2dff7/12eb58a4008844c198d2187357573c87 [2025-04-30 10:27:42,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:27:42,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:27:42,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:27:42,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:27:42,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:27:42,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:27:42" (1/1) ... [2025-04-30 10:27:42,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3afb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:42, skipping insertion in model container [2025-04-30 10:27:42,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:27:42" (1/1) ... [2025-04-30 10:27:42,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:27:42,840 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:27:42,869 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:27:42,939 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:27:42,989 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:27:42,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:42 WrapperNode [2025-04-30 10:27:42,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:27:42,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:27:42,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:27:42,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:27:42,994 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:27:42" (1/1) ... [2025-04-30 10:27:43,021 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:27:42" (1/1) ... [2025-04-30 10:27:43,055 INFO L138 Inliner]: procedures = 372, calls = 95, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 414 [2025-04-30 10:27:43,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:27:43,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:27:43,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:27:43,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:27:43,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:42" (1/1) ... [2025-04-30 10:27:43,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:42" (1/1) ... [2025-04-30 10:27:43,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:42" (1/1) ... [2025-04-30 10:27:43,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:42" (1/1) ... [2025-04-30 10:27:43,092 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:42" (1/1) ... [2025-04-30 10:27:43,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:42" (1/1) ... [2025-04-30 10:27:43,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:42" (1/1) ... [2025-04-30 10:27:43,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:42" (1/1) ... [2025-04-30 10:27:43,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:42" (1/1) ... [2025-04-30 10:27:43,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:27:43,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:27:43,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:27:43,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:27:43,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:42" (1/1) ... [2025-04-30 10:27:43,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:43,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:43,140 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:27:43,142 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:27:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-30 10:27:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-30 10:27:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:27:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:27:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:27:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:27:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:27:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:27:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-30 10:27:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:27:43,160 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:27:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:27:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:27:43,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:27:43,161 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:27:43,283 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:27:43,284 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:27:43,913 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:27:43,914 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:27:43,941 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:27:43,942 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:27:43,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:27:43 BoogieIcfgContainer [2025-04-30 10:27:43,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:27:43,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:27:43,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:27:43,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:27:43,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:27:42" (1/3) ... [2025-04-30 10:27:43,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b5693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:27:43, skipping insertion in model container [2025-04-30 10:27:43,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:42" (2/3) ... [2025-04-30 10:27:43,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b5693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:27:43, skipping insertion in model container [2025-04-30 10:27:43,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:27:43" (3/3) ... [2025-04-30 10:27:43,951 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr.i [2025-04-30 10:27:43,961 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:27:43,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr.i that has 2 procedures, 485 locations, 487 edges, 1 initial locations, 1 loop locations, and 30 error locations. [2025-04-30 10:27:43,965 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:27:44,044 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:27:44,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 488 places, 488 transitions, 980 flow [2025-04-30 10:27:44,212 INFO L116 PetriNetUnfolderBase]: 4/487 cut-off events. [2025-04-30 10:27:44,214 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:44,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 487 events. 4/487 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 363 event pairs, 0 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 359. Up to 2 conditions per place. [2025-04-30 10:27:44,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 488 places, 488 transitions, 980 flow [2025-04-30 10:27:44,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 487 places, 487 transitions, 977 flow [2025-04-30 10:27:44,234 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:27:44,244 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;@6f0717f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:27:44,244 INFO L341 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-04-30 10:27:44,264 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:27:44,264 INFO L116 PetriNetUnfolderBase]: 1/102 cut-off events. [2025-04-30 10:27:44,264 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:44,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:44,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:44,265 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:44,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:44,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1684636376, now seen corresponding path program 1 times [2025-04-30 10:27:44,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:44,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819863451] [2025-04-30 10:27:44,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:44,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:44,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-04-30 10:27:44,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-30 10:27:44,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:44,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:45,005 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:27:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:45,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819863451] [2025-04-30 10:27:45,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819863451] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:45,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:45,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877719317] [2025-04-30 10:27:45,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:45,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:45,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:45,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:45,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:45,675 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 488 [2025-04-30 10:27:45,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 487 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 0 states have call successors, (0), 0 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:27:45,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:45,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 488 [2025-04-30 10:27:45,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:46,022 INFO L116 PetriNetUnfolderBase]: 365/1842 cut-off events. [2025-04-30 10:27:46,022 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:46,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2708 conditions, 1842 events. 365/1842 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9525 event pairs, 364 based on Foata normal form. 13/1717 useless extension candidates. Maximal degree in co-relation 2256. Up to 842 conditions per place. [2025-04-30 10:27:46,037 INFO L140 encePairwiseOnDemand]: 461/488 looper letters, 113 selfloop transitions, 20 changer transitions 2/480 dead transitions. [2025-04-30 10:27:46,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 480 transitions, 1229 flow [2025-04-30 10:27:46,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2228 transitions. [2025-04-30 10:27:46,059 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7609289617486339 [2025-04-30 10:27:46,061 INFO L175 Difference]: Start difference. First operand has 487 places, 487 transitions, 977 flow. Second operand 6 states and 2228 transitions. [2025-04-30 10:27:46,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 480 transitions, 1229 flow [2025-04-30 10:27:46,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 480 transitions, 1228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:46,078 INFO L231 Difference]: Finished difference. Result has 487 places, 478 transitions, 998 flow [2025-04-30 10:27:46,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=998, PETRI_PLACES=487, PETRI_TRANSITIONS=478} [2025-04-30 10:27:46,084 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 0 predicate places. [2025-04-30 10:27:46,084 INFO L485 AbstractCegarLoop]: Abstraction has has 487 places, 478 transitions, 998 flow [2025-04-30 10:27:46,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 0 states have call successors, (0), 0 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:27:46,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:46,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:46,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:27:46,086 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:46,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash 105681652, now seen corresponding path program 1 times [2025-04-30 10:27:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:46,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450912552] [2025-04-30 10:27:46,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:46,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-30 10:27:46,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-30 10:27:46,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:46,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:46,490 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:27:46,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:46,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450912552] [2025-04-30 10:27:46,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450912552] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:46,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:46,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:46,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612301383] [2025-04-30 10:27:46,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:46,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:46,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:46,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:46,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:47,261 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 488 [2025-04-30 10:27:47,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 478 transitions, 998 flow. Second operand has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 0 states have call successors, (0), 0 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:27:47,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:47,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 488 [2025-04-30 10:27:47,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:47,474 INFO L116 PetriNetUnfolderBase]: 365/1836 cut-off events. [2025-04-30 10:27:47,474 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:47,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2722 conditions, 1836 events. 365/1836 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9518 event pairs, 364 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 2342. Up to 842 conditions per place. [2025-04-30 10:27:47,479 INFO L140 encePairwiseOnDemand]: 464/488 looper letters, 113 selfloop transitions, 20 changer transitions 0/474 dead transitions. [2025-04-30 10:27:47,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 474 transitions, 1256 flow [2025-04-30 10:27:47,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2225 transitions. [2025-04-30 10:27:47,483 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7599043715846995 [2025-04-30 10:27:47,483 INFO L175 Difference]: Start difference. First operand has 487 places, 478 transitions, 998 flow. Second operand 6 states and 2225 transitions. [2025-04-30 10:27:47,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 474 transitions, 1256 flow [2025-04-30 10:27:47,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 474 transitions, 1216 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:47,492 INFO L231 Difference]: Finished difference. Result has 481 places, 474 transitions, 990 flow [2025-04-30 10:27:47,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=990, PETRI_PLACES=481, PETRI_TRANSITIONS=474} [2025-04-30 10:27:47,493 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -6 predicate places. [2025-04-30 10:27:47,493 INFO L485 AbstractCegarLoop]: Abstraction has has 481 places, 474 transitions, 990 flow [2025-04-30 10:27:47,494 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 0 states have call successors, (0), 0 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:27:47,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:47,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:47,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:27:47,495 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:47,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash -710489551, now seen corresponding path program 1 times [2025-04-30 10:27:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:47,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292000047] [2025-04-30 10:27:47,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:47,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:47,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-04-30 10:27:47,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-04-30 10:27:47,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:47,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:47,878 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:27:47,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:47,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292000047] [2025-04-30 10:27:47,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292000047] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:47,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:47,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:47,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548938986] [2025-04-30 10:27:47,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:47,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:47,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:47,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:47,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:48,533 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 488 [2025-04-30 10:27:48,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 474 transitions, 990 flow. Second operand has 6 states, 6 states have (on average 351.8333333333333) internal successors, (2111), 6 states have internal predecessors, (2111), 0 states have call successors, (0), 0 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:27:48,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:48,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 488 [2025-04-30 10:27:48,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:48,762 INFO L116 PetriNetUnfolderBase]: 391/1924 cut-off events. [2025-04-30 10:27:48,763 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:27:48,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2864 conditions, 1924 events. 391/1924 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10188 event pairs, 390 based on Foata normal form. 0/1787 useless extension candidates. Maximal degree in co-relation 2468. Up to 911 conditions per place. [2025-04-30 10:27:48,771 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 130 selfloop transitions, 5 changer transitions 0/473 dead transitions. [2025-04-30 10:27:48,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 473 transitions, 1258 flow [2025-04-30 10:27:48,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2230 transitions. [2025-04-30 10:27:48,778 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7616120218579235 [2025-04-30 10:27:48,778 INFO L175 Difference]: Start difference. First operand has 481 places, 474 transitions, 990 flow. Second operand 6 states and 2230 transitions. [2025-04-30 10:27:48,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 473 transitions, 1258 flow [2025-04-30 10:27:48,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 473 transitions, 1218 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:48,786 INFO L231 Difference]: Finished difference. Result has 480 places, 473 transitions, 958 flow [2025-04-30 10:27:48,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=958, PETRI_PLACES=480, PETRI_TRANSITIONS=473} [2025-04-30 10:27:48,788 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -7 predicate places. [2025-04-30 10:27:48,788 INFO L485 AbstractCegarLoop]: Abstraction has has 480 places, 473 transitions, 958 flow [2025-04-30 10:27:48,789 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 351.8333333333333) internal successors, (2111), 6 states have internal predecessors, (2111), 0 states have call successors, (0), 0 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:27:48,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:48,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:27:48,790 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:48,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash -948055330, now seen corresponding path program 1 times [2025-04-30 10:27:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:48,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841624457] [2025-04-30 10:27:48,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:48,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:48,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-30 10:27:48,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-30 10:27:48,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:48,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:48,909 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:27:48,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:48,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841624457] [2025-04-30 10:27:48,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841624457] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:48,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:48,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:27:48,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010929763] [2025-04-30 10:27:48,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:48,912 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:48,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:48,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:48,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:48,940 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 488 [2025-04-30 10:27:48,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 473 transitions, 958 flow. Second operand has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 0 states have call successors, (0), 0 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:27:48,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:48,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 488 [2025-04-30 10:27:48,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:49,015 INFO L116 PetriNetUnfolderBase]: 7/658 cut-off events. [2025-04-30 10:27:49,016 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:49,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 658 events. 7/658 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 633 event pairs, 6 based on Foata normal form. 1/623 useless extension candidates. Maximal degree in co-relation 496. Up to 24 conditions per place. [2025-04-30 10:27:49,019 INFO L140 encePairwiseOnDemand]: 485/488 looper letters, 10 selfloop transitions, 2 changer transitions 0/474 dead transitions. [2025-04-30 10:27:49,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 474 transitions, 984 flow [2025-04-30 10:27:49,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1435 transitions. [2025-04-30 10:27:49,022 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.980191256830601 [2025-04-30 10:27:49,022 INFO L175 Difference]: Start difference. First operand has 480 places, 473 transitions, 958 flow. Second operand 3 states and 1435 transitions. [2025-04-30 10:27:49,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 474 transitions, 984 flow [2025-04-30 10:27:49,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 474 transitions, 974 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:49,030 INFO L231 Difference]: Finished difference. Result has 478 places, 474 transitions, 960 flow [2025-04-30 10:27:49,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=960, PETRI_PLACES=478, PETRI_TRANSITIONS=474} [2025-04-30 10:27:49,032 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-04-30 10:27:49,032 INFO L485 AbstractCegarLoop]: Abstraction has has 478 places, 474 transitions, 960 flow [2025-04-30 10:27:49,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 0 states have call successors, (0), 0 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:27:49,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:49,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:49,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:27:49,033 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:49,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:49,034 INFO L85 PathProgramCache]: Analyzing trace with hash 177590593, now seen corresponding path program 1 times [2025-04-30 10:27:49,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:49,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379631005] [2025-04-30 10:27:49,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:49,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:49,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-04-30 10:27:49,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-04-30 10:27:49,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:49,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:49,514 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:27:49,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:49,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379631005] [2025-04-30 10:27:49,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379631005] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:49,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:49,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:49,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338198174] [2025-04-30 10:27:49,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:49,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:49,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:49,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:50,229 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 488 [2025-04-30 10:27:50,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 474 transitions, 960 flow. Second operand has 6 states, 6 states have (on average 395.8333333333333) internal successors, (2375), 6 states have internal predecessors, (2375), 0 states have call successors, (0), 0 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:27:50,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:50,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 488 [2025-04-30 10:27:50,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:50,406 INFO L116 PetriNetUnfolderBase]: 55/899 cut-off events. [2025-04-30 10:27:50,406 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-30 10:27:50,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 899 events. 55/899 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2268 event pairs, 54 based on Foata normal form. 0/839 useless extension candidates. Maximal degree in co-relation 924. Up to 227 conditions per place. [2025-04-30 10:27:50,408 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 89 selfloop transitions, 5 changer transitions 0/473 dead transitions. [2025-04-30 10:27:50,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 473 transitions, 1146 flow [2025-04-30 10:27:50,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2440 transitions. [2025-04-30 10:27:50,413 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-04-30 10:27:50,413 INFO L175 Difference]: Start difference. First operand has 478 places, 474 transitions, 960 flow. Second operand 6 states and 2440 transitions. [2025-04-30 10:27:50,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 473 transitions, 1146 flow [2025-04-30 10:27:50,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 473 transitions, 1144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:50,418 INFO L231 Difference]: Finished difference. Result has 481 places, 473 transitions, 966 flow [2025-04-30 10:27:50,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=966, PETRI_PLACES=481, PETRI_TRANSITIONS=473} [2025-04-30 10:27:50,419 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -6 predicate places. [2025-04-30 10:27:50,419 INFO L485 AbstractCegarLoop]: Abstraction has has 481 places, 473 transitions, 966 flow [2025-04-30 10:27:50,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.8333333333333) internal successors, (2375), 6 states have internal predecessors, (2375), 0 states have call successors, (0), 0 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:27:50,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:50,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:50,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:27:50,421 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:50,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash 351751304, now seen corresponding path program 1 times [2025-04-30 10:27:50,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:50,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558983553] [2025-04-30 10:27:50,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:50,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:50,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-04-30 10:27:50,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-04-30 10:27:50,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:50,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:50,799 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:27:50,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:50,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558983553] [2025-04-30 10:27:50,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558983553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:50,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:50,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:50,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301166658] [2025-04-30 10:27:50,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:50,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:50,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:50,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:50,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:51,357 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 488 [2025-04-30 10:27:51,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 473 transitions, 966 flow. Second operand has 6 states, 6 states have (on average 378.5) internal successors, (2271), 6 states have internal predecessors, (2271), 0 states have call successors, (0), 0 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:27:51,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:51,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 488 [2025-04-30 10:27:51,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:51,549 INFO L116 PetriNetUnfolderBase]: 37/812 cut-off events. [2025-04-30 10:27:51,549 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:27:51,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 812 events. 37/812 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1739 event pairs, 36 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 792. Up to 198 conditions per place. [2025-04-30 10:27:51,552 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 93 selfloop transitions, 15 changer transitions 0/470 dead transitions. [2025-04-30 10:27:51,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 470 transitions, 1176 flow [2025-04-30 10:27:51,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2355 transitions. [2025-04-30 10:27:51,556 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8043032786885246 [2025-04-30 10:27:51,556 INFO L175 Difference]: Start difference. First operand has 481 places, 473 transitions, 966 flow. Second operand 6 states and 2355 transitions. [2025-04-30 10:27:51,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 470 transitions, 1176 flow [2025-04-30 10:27:51,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 470 transitions, 1166 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:51,563 INFO L231 Difference]: Finished difference. Result has 478 places, 470 transitions, 980 flow [2025-04-30 10:27:51,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=980, PETRI_PLACES=478, PETRI_TRANSITIONS=470} [2025-04-30 10:27:51,565 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-04-30 10:27:51,565 INFO L485 AbstractCegarLoop]: Abstraction has has 478 places, 470 transitions, 980 flow [2025-04-30 10:27:51,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 378.5) internal successors, (2271), 6 states have internal predecessors, (2271), 0 states have call successors, (0), 0 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:27:51,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:51,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:51,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:27:51,567 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:51,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:51,567 INFO L85 PathProgramCache]: Analyzing trace with hash -25729275, now seen corresponding path program 1 times [2025-04-30 10:27:51,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:51,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481210243] [2025-04-30 10:27:51,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:51,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:51,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-30 10:27:51,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:27:51,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:51,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:51,972 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:27:51,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:51,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481210243] [2025-04-30 10:27:51,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481210243] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:51,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:51,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:51,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384267602] [2025-04-30 10:27:51,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:51,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:51,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:51,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:51,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:52,382 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 488 [2025-04-30 10:27:52,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 470 transitions, 980 flow. Second operand has 6 states, 6 states have (on average 342.1666666666667) internal successors, (2053), 6 states have internal predecessors, (2053), 0 states have call successors, (0), 0 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:27:52,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:52,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 488 [2025-04-30 10:27:52,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:52,744 INFO L116 PetriNetUnfolderBase]: 365/1934 cut-off events. [2025-04-30 10:27:52,744 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:27:52,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2881 conditions, 1934 events. 365/1934 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9512 event pairs, 364 based on Foata normal form. 0/1810 useless extension candidates. Maximal degree in co-relation 2494. Up to 898 conditions per place. [2025-04-30 10:27:52,750 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 131 selfloop transitions, 15 changer transitions 0/467 dead transitions. [2025-04-30 10:27:52,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 467 transitions, 1266 flow [2025-04-30 10:27:52,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2165 transitions. [2025-04-30 10:27:52,754 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7394125683060109 [2025-04-30 10:27:52,754 INFO L175 Difference]: Start difference. First operand has 478 places, 470 transitions, 980 flow. Second operand 6 states and 2165 transitions. [2025-04-30 10:27:52,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 467 transitions, 1266 flow [2025-04-30 10:27:52,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 467 transitions, 1236 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:52,759 INFO L231 Difference]: Finished difference. Result has 475 places, 467 transitions, 974 flow [2025-04-30 10:27:52,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=974, PETRI_PLACES=475, PETRI_TRANSITIONS=467} [2025-04-30 10:27:52,761 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -12 predicate places. [2025-04-30 10:27:52,762 INFO L485 AbstractCegarLoop]: Abstraction has has 475 places, 467 transitions, 974 flow [2025-04-30 10:27:52,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 342.1666666666667) internal successors, (2053), 6 states have internal predecessors, (2053), 0 states have call successors, (0), 0 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:27:52,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:52,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:52,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:27:52,763 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:52,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:52,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2014753825, now seen corresponding path program 1 times [2025-04-30 10:27:52,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:52,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996633136] [2025-04-30 10:27:52,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:52,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:52,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-04-30 10:27:52,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-04-30 10:27:52,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:52,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:53,121 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:27:53,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:53,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996633136] [2025-04-30 10:27:53,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996633136] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:53,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:53,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:53,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450595489] [2025-04-30 10:27:53,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:53,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:53,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:53,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:53,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:53,506 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 488 [2025-04-30 10:27:53,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 467 transitions, 974 flow. Second operand has 6 states, 6 states have (on average 345.6666666666667) internal successors, (2074), 6 states have internal predecessors, (2074), 0 states have call successors, (0), 0 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:27:53,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:53,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 488 [2025-04-30 10:27:53,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:53,844 INFO L116 PetriNetUnfolderBase]: 365/1930 cut-off events. [2025-04-30 10:27:53,845 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:27:53,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 1930 events. 365/1930 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9500 event pairs, 364 based on Foata normal form. 0/1810 useless extension candidates. Maximal degree in co-relation 2490. Up to 894 conditions per place. [2025-04-30 10:27:53,851 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 128 selfloop transitions, 15 changer transitions 0/464 dead transitions. [2025-04-30 10:27:53,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 464 transitions, 1254 flow [2025-04-30 10:27:53,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:53,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2180 transitions. [2025-04-30 10:27:53,855 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.744535519125683 [2025-04-30 10:27:53,855 INFO L175 Difference]: Start difference. First operand has 475 places, 467 transitions, 974 flow. Second operand 6 states and 2180 transitions. [2025-04-30 10:27:53,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 464 transitions, 1254 flow [2025-04-30 10:27:53,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 464 transitions, 1224 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:53,860 INFO L231 Difference]: Finished difference. Result has 472 places, 464 transitions, 968 flow [2025-04-30 10:27:53,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=968, PETRI_PLACES=472, PETRI_TRANSITIONS=464} [2025-04-30 10:27:53,864 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -15 predicate places. [2025-04-30 10:27:53,864 INFO L485 AbstractCegarLoop]: Abstraction has has 472 places, 464 transitions, 968 flow [2025-04-30 10:27:53,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 345.6666666666667) internal successors, (2074), 6 states have internal predecessors, (2074), 0 states have call successors, (0), 0 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:27:53,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:53,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:53,865 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:27:53,865 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:53,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:53,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1200167647, now seen corresponding path program 1 times [2025-04-30 10:27:53,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:53,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043647896] [2025-04-30 10:27:53,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:53,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-04-30 10:27:53,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-04-30 10:27:53,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:53,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:27:54,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:54,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043647896] [2025-04-30 10:27:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043647896] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:54,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471555282] [2025-04-30 10:27:54,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:54,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:54,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:54,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:27:54,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:27:54,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-04-30 10:27:54,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-04-30 10:27:54,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:54,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:54,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:27:54,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:27:54,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:27:54,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471555282] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:54,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:54,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:27:54,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80237204] [2025-04-30 10:27:54,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:54,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:54,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:54,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:27:54,671 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-04-30 10:27:54,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 464 transitions, 968 flow. Second operand has 10 states, 10 states have (on average 472.8) internal successors, (4728), 10 states have internal predecessors, (4728), 0 states have call successors, (0), 0 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:27:54,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:54,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-04-30 10:27:54,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:54,781 INFO L116 PetriNetUnfolderBase]: 7/752 cut-off events. [2025-04-30 10:27:54,781 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:54,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 752 events. 7/752 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 387 event pairs, 6 based on Foata normal form. 2/732 useless extension candidates. Maximal degree in co-relation 394. Up to 24 conditions per place. [2025-04-30 10:27:54,783 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 14 selfloop transitions, 9 changer transitions 0/472 dead transitions. [2025-04-30 10:27:54,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 472 transitions, 1032 flow [2025-04-30 10:27:54,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4264 transitions. [2025-04-30 10:27:54,789 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.970856102003643 [2025-04-30 10:27:54,790 INFO L175 Difference]: Start difference. First operand has 472 places, 464 transitions, 968 flow. Second operand 9 states and 4264 transitions. [2025-04-30 10:27:54,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 472 transitions, 1032 flow [2025-04-30 10:27:54,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 472 transitions, 1002 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:54,795 INFO L231 Difference]: Finished difference. Result has 478 places, 470 transitions, 988 flow [2025-04-30 10:27:54,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=988, PETRI_PLACES=478, PETRI_TRANSITIONS=470} [2025-04-30 10:27:54,796 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-04-30 10:27:54,796 INFO L485 AbstractCegarLoop]: Abstraction has has 478 places, 470 transitions, 988 flow [2025-04-30 10:27:54,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 472.8) internal successors, (4728), 10 states have internal predecessors, (4728), 0 states have call successors, (0), 0 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:27:54,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:54,798 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:54,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:27:55,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:55,003 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:55,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:55,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1820236185, now seen corresponding path program 2 times [2025-04-30 10:27:55,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:55,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006435867] [2025-04-30 10:27:55,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:55,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:55,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 446 statements into 2 equivalence classes. [2025-04-30 10:27:55,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 128 of 446 statements. [2025-04-30 10:27:55,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:55,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-04-30 10:27:55,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:55,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006435867] [2025-04-30 10:27:55,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006435867] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:55,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:55,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:55,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002798800] [2025-04-30 10:27:55,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:55,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:55,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:55,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:55,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:55,981 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 488 [2025-04-30 10:27:55,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 470 transitions, 988 flow. Second operand has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 0 states have call successors, (0), 0 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:27:55,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:55,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 488 [2025-04-30 10:27:55,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:56,457 INFO L116 PetriNetUnfolderBase]: 257/2078 cut-off events. [2025-04-30 10:27:56,457 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-30 10:27:56,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 2078 events. 257/2078 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10232 event pairs, 36 based on Foata normal form. 0/1951 useless extension candidates. Maximal degree in co-relation 2279. Up to 523 conditions per place. [2025-04-30 10:27:56,465 INFO L140 encePairwiseOnDemand]: 459/488 looper letters, 99 selfloop transitions, 75 changer transitions 0/547 dead transitions. [2025-04-30 10:27:56,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 547 transitions, 1490 flow [2025-04-30 10:27:56,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2504 transitions. [2025-04-30 10:27:56,469 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.855191256830601 [2025-04-30 10:27:56,469 INFO L175 Difference]: Start difference. First operand has 478 places, 470 transitions, 988 flow. Second operand 6 states and 2504 transitions. [2025-04-30 10:27:56,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 547 transitions, 1490 flow [2025-04-30 10:27:56,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 547 transitions, 1484 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:56,478 INFO L231 Difference]: Finished difference. Result has 486 places, 538 transitions, 1462 flow [2025-04-30 10:27:56,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1462, PETRI_PLACES=486, PETRI_TRANSITIONS=538} [2025-04-30 10:27:56,479 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -1 predicate places. [2025-04-30 10:27:56,479 INFO L485 AbstractCegarLoop]: Abstraction has has 486 places, 538 transitions, 1462 flow [2025-04-30 10:27:56,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 0 states have call successors, (0), 0 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:27:56,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:56,480 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:56,480 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:27:56,481 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:56,481 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:56,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1970437980, now seen corresponding path program 1 times [2025-04-30 10:27:56,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:56,481 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432063822] [2025-04-30 10:27:56,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:56,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:56,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-04-30 10:27:56,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-04-30 10:27:56,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:56,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:27:56,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:56,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432063822] [2025-04-30 10:27:56,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432063822] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:56,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826468247] [2025-04-30 10:27:56,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:56,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:56,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:56,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:27:56,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:27:57,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-04-30 10:27:57,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-04-30 10:27:57,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:57,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:57,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 1878 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:27:57,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:27:57,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:27:57,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826468247] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:57,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:57,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-30 10:27:57,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091085305] [2025-04-30 10:27:57,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:57,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:27:57,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:57,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:27:57,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:27:58,182 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-04-30 10:27:58,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 538 transitions, 1462 flow. Second operand has 18 states, 18 states have (on average 472.8888888888889) internal successors, (8512), 18 states have internal predecessors, (8512), 0 states have call successors, (0), 0 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:27:58,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:58,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-04-30 10:27:58,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:58,686 INFO L116 PetriNetUnfolderBase]: 120/2148 cut-off events. [2025-04-30 10:27:58,687 INFO L117 PetriNetUnfolderBase]: For 184/204 co-relation queries the response was YES. [2025-04-30 10:27:58,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2823 conditions, 2148 events. 120/2148 cut-off events. For 184/204 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7263 event pairs, 21 based on Foata normal form. 4/2064 useless extension candidates. Maximal degree in co-relation 1926. Up to 207 conditions per place. [2025-04-30 10:27:58,694 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 19 selfloop transitions, 21 changer transitions 0/556 dead transitions. [2025-04-30 10:27:58,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 556 transitions, 1630 flow [2025-04-30 10:27:58,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:27:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:27:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9934 transitions. [2025-04-30 10:27:58,705 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.96935987509758 [2025-04-30 10:27:58,705 INFO L175 Difference]: Start difference. First operand has 486 places, 538 transitions, 1462 flow. Second operand 21 states and 9934 transitions. [2025-04-30 10:27:58,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 556 transitions, 1630 flow [2025-04-30 10:27:58,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 556 transitions, 1630 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:58,713 INFO L231 Difference]: Finished difference. Result has 511 places, 551 transitions, 1592 flow [2025-04-30 10:27:58,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1592, PETRI_PLACES=511, PETRI_TRANSITIONS=551} [2025-04-30 10:27:58,714 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 24 predicate places. [2025-04-30 10:27:58,714 INFO L485 AbstractCegarLoop]: Abstraction has has 511 places, 551 transitions, 1592 flow [2025-04-30 10:27:58,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 472.8888888888889) internal successors, (8512), 18 states have internal predecessors, (8512), 0 states have call successors, (0), 0 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:27:58,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:58,717 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:58,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:27:58,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-30 10:27:58,917 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:58,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:58,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1861836312, now seen corresponding path program 2 times [2025-04-30 10:27:58,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:58,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980102216] [2025-04-30 10:27:58,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:58,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:59,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 936 statements into 2 equivalence classes. [2025-04-30 10:27:59,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 194 of 936 statements. [2025-04-30 10:27:59,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:59,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2282 trivial. 0 not checked. [2025-04-30 10:27:59,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:59,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980102216] [2025-04-30 10:27:59,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980102216] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:59,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:59,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:59,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529530723] [2025-04-30 10:27:59,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:59,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:59,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:59,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:59,867 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 488 [2025-04-30 10:27:59,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 551 transitions, 1592 flow. Second operand has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 0 states have call successors, (0), 0 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:27:59,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:59,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 488 [2025-04-30 10:27:59,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:00,308 INFO L116 PetriNetUnfolderBase]: 182/2312 cut-off events. [2025-04-30 10:28:00,308 INFO L117 PetriNetUnfolderBase]: For 448/478 co-relation queries the response was YES. [2025-04-30 10:28:00,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 2312 events. 182/2312 cut-off events. For 448/478 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9100 event pairs, 54 based on Foata normal form. 0/2210 useless extension candidates. Maximal degree in co-relation 2480. Up to 572 conditions per place. [2025-04-30 10:28:00,318 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 150 selfloop transitions, 5 changer transitions 0/550 dead transitions. [2025-04-30 10:28:00,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 550 transitions, 1900 flow [2025-04-30 10:28:00,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2455 transitions. [2025-04-30 10:28:00,321 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8384562841530054 [2025-04-30 10:28:00,321 INFO L175 Difference]: Start difference. First operand has 511 places, 551 transitions, 1592 flow. Second operand 6 states and 2455 transitions. [2025-04-30 10:28:00,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 550 transitions, 1900 flow [2025-04-30 10:28:00,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 550 transitions, 1876 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:28:00,330 INFO L231 Difference]: Finished difference. Result has 509 places, 550 transitions, 1576 flow [2025-04-30 10:28:00,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1566, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1576, PETRI_PLACES=509, PETRI_TRANSITIONS=550} [2025-04-30 10:28:00,331 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 22 predicate places. [2025-04-30 10:28:00,331 INFO L485 AbstractCegarLoop]: Abstraction has has 509 places, 550 transitions, 1576 flow [2025-04-30 10:28:00,333 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 0 states have call successors, (0), 0 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:28:00,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:00,333 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:00,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:28:00,333 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:28:00,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:00,335 INFO L85 PathProgramCache]: Analyzing trace with hash 42095620, now seen corresponding path program 1 times [2025-04-30 10:28:00,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:00,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898943530] [2025-04-30 10:28:00,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:00,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:00,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-04-30 10:28:00,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-04-30 10:28:00,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:00,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 2275 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:28:01,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:01,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898943530] [2025-04-30 10:28:01,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898943530] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:01,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153502568] [2025-04-30 10:28:01,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:01,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:01,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:01,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:28:01,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:28:02,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-04-30 10:28:02,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-04-30 10:28:02,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:02,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:02,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 3788 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:28:02,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 2275 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:28:03,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:28:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 2275 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:28:03,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153502568] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:28:03,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:28:03,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-30 10:28:03,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277215250] [2025-04-30 10:28:03,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:28:03,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:28:03,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:03,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:28:03,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:28:03,788 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-04-30 10:28:03,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 550 transitions, 1576 flow. Second operand has 23 states, 23 states have (on average 473.0869565217391) internal successors, (10881), 23 states have internal predecessors, (10881), 0 states have call successors, (0), 0 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:28:03,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:03,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-04-30 10:28:03,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:04,415 INFO L116 PetriNetUnfolderBase]: 120/2465 cut-off events. [2025-04-30 10:28:04,416 INFO L117 PetriNetUnfolderBase]: For 301/321 co-relation queries the response was YES. [2025-04-30 10:28:04,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 2465 events. 120/2465 cut-off events. For 301/321 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7273 event pairs, 21 based on Foata normal form. 3/2381 useless extension candidates. Maximal degree in co-relation 1937. Up to 207 conditions per place. [2025-04-30 10:28:04,423 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 22 selfloop transitions, 30 changer transitions 0/567 dead transitions. [2025-04-30 10:28:04,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 567 transitions, 1802 flow [2025-04-30 10:28:04,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:28:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-30 10:28:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 14184 transitions. [2025-04-30 10:28:04,436 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9688524590163935 [2025-04-30 10:28:04,436 INFO L175 Difference]: Start difference. First operand has 509 places, 550 transitions, 1576 flow. Second operand 30 states and 14184 transitions. [2025-04-30 10:28:04,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 567 transitions, 1802 flow [2025-04-30 10:28:04,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 567 transitions, 1792 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:04,444 INFO L231 Difference]: Finished difference. Result has 537 places, 560 transitions, 1718 flow [2025-04-30 10:28:04,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1566, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1718, PETRI_PLACES=537, PETRI_TRANSITIONS=560} [2025-04-30 10:28:04,445 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 50 predicate places. [2025-04-30 10:28:04,445 INFO L485 AbstractCegarLoop]: Abstraction has has 537 places, 560 transitions, 1718 flow [2025-04-30 10:28:04,447 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 473.0869565217391) internal successors, (10881), 23 states have internal predecessors, (10881), 0 states have call successors, (0), 0 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:28:04,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:04,448 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:04,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:28:04,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:04,648 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:28:04,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:04,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1887765797, now seen corresponding path program 2 times [2025-04-30 10:28:04,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:04,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100863017] [2025-04-30 10:28:04,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:28:04,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:04,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1305 statements into 2 equivalence classes. [2025-04-30 10:28:04,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 245 of 1305 statements. [2025-04-30 10:28:04,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:28:04,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4880 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4880 trivial. 0 not checked. [2025-04-30 10:28:05,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:05,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100863017] [2025-04-30 10:28:05,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100863017] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:05,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:05,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:05,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096684397] [2025-04-30 10:28:05,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:05,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:05,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:05,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:05,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:05,650 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 488 [2025-04-30 10:28:05,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 560 transitions, 1718 flow. Second operand has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 0 states have call successors, (0), 0 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:28:05,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:05,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 488 [2025-04-30 10:28:05,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:06,668 INFO L116 PetriNetUnfolderBase]: 500/3534 cut-off events. [2025-04-30 10:28:06,668 INFO L117 PetriNetUnfolderBase]: For 933/998 co-relation queries the response was YES. [2025-04-30 10:28:06,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5992 conditions, 3534 events. 500/3534 cut-off events. For 933/998 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16046 event pairs, 92 based on Foata normal form. 16/3393 useless extension candidates. Maximal degree in co-relation 4427. Up to 1097 conditions per place. [2025-04-30 10:28:06,680 INFO L140 encePairwiseOnDemand]: 465/488 looper letters, 163 selfloop transitions, 130 changer transitions 0/697 dead transitions. [2025-04-30 10:28:06,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 697 transitions, 2954 flow [2025-04-30 10:28:06,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2533 transitions. [2025-04-30 10:28:06,682 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8650956284153005 [2025-04-30 10:28:06,682 INFO L175 Difference]: Start difference. First operand has 537 places, 560 transitions, 1718 flow. Second operand 6 states and 2533 transitions. [2025-04-30 10:28:06,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 697 transitions, 2954 flow [2025-04-30 10:28:06,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 697 transitions, 2908 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-30 10:28:06,693 INFO L231 Difference]: Finished difference. Result has 529 places, 689 transitions, 2900 flow [2025-04-30 10:28:06,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2900, PETRI_PLACES=529, PETRI_TRANSITIONS=689} [2025-04-30 10:28:06,694 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 42 predicate places. [2025-04-30 10:28:06,694 INFO L485 AbstractCegarLoop]: Abstraction has has 529 places, 689 transitions, 2900 flow [2025-04-30 10:28:06,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 0 states have call successors, (0), 0 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:28:06,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:06,695 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:06,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:28:06,695 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:28:06,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:06,698 INFO L85 PathProgramCache]: Analyzing trace with hash 585752533, now seen corresponding path program 1 times [2025-04-30 10:28:06,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:06,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467427578] [2025-04-30 10:28:06,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:06,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:06,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1315 statements into 1 equivalence classes. [2025-04-30 10:28:06,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1315 of 1315 statements. [2025-04-30 10:28:06,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:06,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-04-30 10:28:10,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:10,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467427578] [2025-04-30 10:28:10,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467427578] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:10,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:10,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:10,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689722534] [2025-04-30 10:28:10,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:10,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:10,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:10,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:10,511 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 392 out of 488 [2025-04-30 10:28:10,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 689 transitions, 2900 flow. Second operand has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 0 states have call successors, (0), 0 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:28:10,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:10,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 392 of 488 [2025-04-30 10:28:10,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:11,791 INFO L116 PetriNetUnfolderBase]: 776/4305 cut-off events. [2025-04-30 10:28:11,792 INFO L117 PetriNetUnfolderBase]: For 3294/3458 co-relation queries the response was YES. [2025-04-30 10:28:11,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8856 conditions, 4305 events. 776/4305 cut-off events. For 3294/3458 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22352 event pairs, 65 based on Foata normal form. 52/4192 useless extension candidates. Maximal degree in co-relation 7308. Up to 1357 conditions per place. [2025-04-30 10:28:11,806 INFO L140 encePairwiseOnDemand]: 465/488 looper letters, 285 selfloop transitions, 131 changer transitions 5/827 dead transitions. [2025-04-30 10:28:11,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 827 transitions, 4642 flow [2025-04-30 10:28:11,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2524 transitions. [2025-04-30 10:28:11,807 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8620218579234973 [2025-04-30 10:28:11,807 INFO L175 Difference]: Start difference. First operand has 529 places, 689 transitions, 2900 flow. Second operand 6 states and 2524 transitions. [2025-04-30 10:28:11,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 827 transitions, 4642 flow [2025-04-30 10:28:11,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 827 transitions, 4642 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:11,820 INFO L231 Difference]: Finished difference. Result has 539 places, 817 transitions, 4380 flow [2025-04-30 10:28:11,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=2900, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4380, PETRI_PLACES=539, PETRI_TRANSITIONS=817} [2025-04-30 10:28:11,821 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 52 predicate places. [2025-04-30 10:28:11,821 INFO L485 AbstractCegarLoop]: Abstraction has has 539 places, 817 transitions, 4380 flow [2025-04-30 10:28:11,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 0 states have call successors, (0), 0 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:28:11,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:11,822 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:11,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:28:11,822 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:28:11,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:11,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1292764922, now seen corresponding path program 1 times [2025-04-30 10:28:11,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:11,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632610026] [2025-04-30 10:28:11,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:11,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:11,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1316 statements into 1 equivalence classes. [2025-04-30 10:28:12,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1316 of 1316 statements. [2025-04-30 10:28:12,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:12,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-04-30 10:28:15,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:15,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632610026] [2025-04-30 10:28:15,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632610026] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:15,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:15,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:15,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971058570] [2025-04-30 10:28:15,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:15,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:15,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:15,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:15,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:15,521 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 488 [2025-04-30 10:28:15,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 817 transitions, 4380 flow. Second operand has 6 states, 6 states have (on average 372.6666666666667) internal successors, (2236), 6 states have internal predecessors, (2236), 0 states have call successors, (0), 0 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:28:15,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:15,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 488 [2025-04-30 10:28:15,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:17,218 INFO L116 PetriNetUnfolderBase]: 1308/5703 cut-off events. [2025-04-30 10:28:17,219 INFO L117 PetriNetUnfolderBase]: For 4872/4929 co-relation queries the response was YES. [2025-04-30 10:28:17,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13640 conditions, 5703 events. 1308/5703 cut-off events. For 4872/4929 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33804 event pairs, 369 based on Foata normal form. 11/5469 useless extension candidates. Maximal degree in co-relation 12008. Up to 2597 conditions per place. [2025-04-30 10:28:17,240 INFO L140 encePairwiseOnDemand]: 469/488 looper letters, 364 selfloop transitions, 84 changer transitions 0/896 dead transitions. [2025-04-30 10:28:17,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 896 transitions, 5674 flow [2025-04-30 10:28:17,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2332 transitions. [2025-04-30 10:28:17,242 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.796448087431694 [2025-04-30 10:28:17,242 INFO L175 Difference]: Start difference. First operand has 539 places, 817 transitions, 4380 flow. Second operand 6 states and 2332 transitions. [2025-04-30 10:28:17,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 896 transitions, 5674 flow [2025-04-30 10:28:17,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 896 transitions, 5420 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:17,262 INFO L231 Difference]: Finished difference. Result has 548 places, 888 transitions, 4916 flow [2025-04-30 10:28:17,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=4132, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=769, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4916, PETRI_PLACES=548, PETRI_TRANSITIONS=888} [2025-04-30 10:28:17,263 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 61 predicate places. [2025-04-30 10:28:17,264 INFO L485 AbstractCegarLoop]: Abstraction has has 548 places, 888 transitions, 4916 flow [2025-04-30 10:28:17,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 372.6666666666667) internal successors, (2236), 6 states have internal predecessors, (2236), 0 states have call successors, (0), 0 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:28:17,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:17,264 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:17,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:28:17,265 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:28:17,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:17,267 INFO L85 PathProgramCache]: Analyzing trace with hash 710380626, now seen corresponding path program 1 times [2025-04-30 10:28:17,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:17,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958442797] [2025-04-30 10:28:17,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:17,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:17,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes. [2025-04-30 10:28:19,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements. [2025-04-30 10:28:19,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:19,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1 proven. 1585 refuted. 0 times theorem prover too weak. 3314 trivial. 0 not checked. [2025-04-30 10:28:36,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:36,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958442797] [2025-04-30 10:28:36,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958442797] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:36,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387683980] [2025-04-30 10:28:36,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:36,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:36,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:36,752 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:28:36,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:28:37,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes. [2025-04-30 10:28:38,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements. [2025-04-30 10:28:38,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:38,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:38,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 5102 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-04-30 10:28:38,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:38,372 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:28:38,373 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:28:38,573 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:28:38,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:28:38,822 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:28:38,822 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:28:38,960 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:28:38,961 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:28:39,196 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:28:39,197 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:28:39,553 INFO L325 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-04-30 10:28:39,553 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 Killed by 15