./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.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 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:51:38,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:51:38,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:51:38,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:51:38,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:51:38,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:51:38,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:51:38,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:51:38,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:51:38,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:51:38,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:51:38,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:51:38,876 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:51:38,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:51:38,877 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:51:38,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:51:38,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:51:38,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:51:38,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:51:38,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:51:38,878 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:51:38,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:51:38,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:51:38,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:51:38,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:51:38,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:51:38,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:51:38,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:51:38,878 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 -> 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 [2025-03-04 06:51:39,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:51:39,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:51:39,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:51:39,116 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:51:39,116 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:51:39,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-03-04 06:51:40,246 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7022ea9fb/6c5b519ab6d64f548a131d4afb44250e/FLAG9f6e45b74 [2025-03-04 06:51:40,569 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:51:40,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-03-04 06:51:40,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7022ea9fb/6c5b519ab6d64f548a131d4afb44250e/FLAG9f6e45b74 [2025-03-04 06:51:40,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7022ea9fb/6c5b519ab6d64f548a131d4afb44250e [2025-03-04 06:51:40,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:51:40,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:51:40,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:51:40,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:51:40,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:51:40,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:51:40" (1/1) ... [2025-03-04 06:51:40,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eb7db94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:40, skipping insertion in model container [2025-03-04 06:51:40,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:51:40" (1/1) ... [2025-03-04 06:51:40,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:51:41,025 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,026 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,026 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,026 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:51:41,095 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:51:41,127 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,132 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,133 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,134 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:51:41,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:51:41,192 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:51:41,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41 WrapperNode [2025-03-04 06:51:41,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:51:41,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:51:41,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:51:41,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:51:41,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,235 INFO L138 Inliner]: procedures = 280, calls = 136, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 433 [2025-03-04 06:51:41,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:51:41,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:51:41,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:51:41,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:51:41,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,266 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:51:41,284 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:51:41,284 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:51:41,284 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:51:41,285 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (1/1) ... [2025-03-04 06:51:41,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:51:41,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:51:41,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:51:41,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:51:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:51:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:51:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:51:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 06:51:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:51:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:51:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:51:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:51:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:51:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:51:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:51:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:51:41,336 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:51:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:51:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:51:41,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:51:41,338 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:51:41,475 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:51:41,476 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:51:42,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 06:51:42,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 06:51:42,176 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:51:42,176 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:51:42,201 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:51:42,201 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:51:42,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:51:42 BoogieIcfgContainer [2025-03-04 06:51:42,201 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:51:42,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:51:42,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:51:42,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:51:42,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:51:40" (1/3) ... [2025-03-04 06:51:42,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b21fb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:51:42, skipping insertion in model container [2025-03-04 06:51:42,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:51:41" (2/3) ... [2025-03-04 06:51:42,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b21fb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:51:42, skipping insertion in model container [2025-03-04 06:51:42,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:51:42" (3/3) ... [2025-03-04 06:51:42,211 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_92-evilcollapse_racing.i [2025-03-04 06:51:42,221 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:51:42,223 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_92-evilcollapse_racing.i that has 2 procedures, 473 locations, 1 initial locations, 10 loop locations, and 23 error locations. [2025-03-04 06:51:42,223 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:51:42,305 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:51:42,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 476 places, 494 transitions, 995 flow [2025-03-04 06:51:42,518 INFO L124 PetriNetUnfolderBase]: 21/524 cut-off events. [2025-03-04 06:51:42,520 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:51:42,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 524 events. 21/524 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 948 event pairs, 0 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 344. Up to 4 conditions per place. [2025-03-04 06:51:42,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 476 places, 494 transitions, 995 flow [2025-03-04 06:51:42,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 476 places, 494 transitions, 995 flow [2025-03-04 06:51:42,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:51:42,541 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2d11ce27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:51:42,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-04 06:51:42,557 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:51:42,558 INFO L124 PetriNetUnfolderBase]: 0/121 cut-off events. [2025-03-04 06:51:42,558 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:51:42,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:42,558 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] [2025-03-04 06:51:42,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:51:42,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:42,563 INFO L85 PathProgramCache]: Analyzing trace with hash 104462160, now seen corresponding path program 1 times [2025-03-04 06:51:42,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:42,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786097065] [2025-03-04 06:51:42,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:42,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:42,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 06:51:42,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 06:51:42,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:42,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:43,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-03-04 06:51:43,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:43,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786097065] [2025-03-04 06:51:43,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786097065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:43,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:43,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:43,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101078784] [2025-03-04 06:51:43,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:43,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:43,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:43,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:43,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:43,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2025-03-04 06:51:44,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 494 transitions, 995 flow. Second operand has 6 states, 6 states have (on average 371.3333333333333) internal successors, (2228), 6 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:44,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:44,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2025-03-04 06:51:44,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:44,458 INFO L124 PetriNetUnfolderBase]: 319/1684 cut-off events. [2025-03-04 06:51:44,459 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-04 06:51:44,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2390 conditions, 1684 events. 319/1684 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9520 event pairs, 288 based on Foata normal form. 79/1627 useless extension candidates. Maximal degree in co-relation 1963. Up to 690 conditions per place. [2025-03-04 06:51:44,468 INFO L140 encePairwiseOnDemand]: 467/494 looper letters, 96 selfloop transitions, 10 changer transitions 2/475 dead transitions. [2025-03-04 06:51:44,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 475 transitions, 1169 flow [2025-03-04 06:51:44,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2343 transitions. [2025-03-04 06:51:44,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904858299595142 [2025-03-04 06:51:44,488 INFO L175 Difference]: Start difference. First operand has 476 places, 494 transitions, 995 flow. Second operand 6 states and 2343 transitions. [2025-03-04 06:51:44,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 475 transitions, 1169 flow [2025-03-04 06:51:44,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 475 transitions, 1169 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:51:44,500 INFO L231 Difference]: Finished difference. Result has 477 places, 473 transitions, 973 flow [2025-03-04 06:51:44,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=973, PETRI_PLACES=477, PETRI_TRANSITIONS=473} [2025-03-04 06:51:44,506 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 1 predicate places. [2025-03-04 06:51:44,507 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 473 transitions, 973 flow [2025-03-04 06:51:44,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 371.3333333333333) internal successors, (2228), 6 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:44,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:44,508 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] [2025-03-04 06:51:44,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:51:44,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:51:44,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:44,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1201978236, now seen corresponding path program 1 times [2025-03-04 06:51:44,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:44,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489335499] [2025-03-04 06:51:44,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:44,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:44,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 06:51:44,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 06:51:44,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:44,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:44,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:44,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489335499] [2025-03-04 06:51:44,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489335499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:44,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:44,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:44,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018721645] [2025-03-04 06:51:44,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:44,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:44,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:44,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:44,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:45,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2025-03-04 06:51:45,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 473 transitions, 973 flow. Second operand has 6 states, 6 states have (on average 371.3333333333333) internal successors, (2228), 6 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:45,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:45,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2025-03-04 06:51:45,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:45,816 INFO L124 PetriNetUnfolderBase]: 319/1680 cut-off events. [2025-03-04 06:51:45,816 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-04 06:51:45,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2397 conditions, 1680 events. 319/1680 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9522 event pairs, 288 based on Foata normal form. 0/1548 useless extension candidates. Maximal degree in co-relation 2222. Up to 690 conditions per place. [2025-03-04 06:51:45,822 INFO L140 encePairwiseOnDemand]: 482/494 looper letters, 96 selfloop transitions, 10 changer transitions 0/471 dead transitions. [2025-03-04 06:51:45,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 471 transitions, 1181 flow [2025-03-04 06:51:45,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2328 transitions. [2025-03-04 06:51:45,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7854251012145749 [2025-03-04 06:51:45,827 INFO L175 Difference]: Start difference. First operand has 477 places, 473 transitions, 973 flow. Second operand 6 states and 2328 transitions. [2025-03-04 06:51:45,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 471 transitions, 1181 flow [2025-03-04 06:51:45,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 471 transitions, 1161 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:45,834 INFO L231 Difference]: Finished difference. Result has 473 places, 471 transitions, 969 flow [2025-03-04 06:51:45,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=969, PETRI_PLACES=473, PETRI_TRANSITIONS=471} [2025-03-04 06:51:45,835 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -3 predicate places. [2025-03-04 06:51:45,835 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 471 transitions, 969 flow [2025-03-04 06:51:45,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 371.3333333333333) internal successors, (2228), 6 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:45,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:45,841 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] [2025-03-04 06:51:45,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:51:45,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:51:45,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1791493855, now seen corresponding path program 1 times [2025-03-04 06:51:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:45,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18219845] [2025-03-04 06:51:45,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:45,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:45,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:51:45,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:51:45,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:45,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:45,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:45,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18219845] [2025-03-04 06:51:45,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18219845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:45,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:45,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:51:45,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167217616] [2025-03-04 06:51:45,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:45,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:45,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:45,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:45,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:45,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 494 [2025-03-04 06:51:45,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 471 transitions, 969 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:45,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:45,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 494 [2025-03-04 06:51:45,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:46,030 INFO L124 PetriNetUnfolderBase]: 15/649 cut-off events. [2025-03-04 06:51:46,030 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-04 06:51:46,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 649 events. 15/649 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1437 event pairs, 8 based on Foata normal form. 1/606 useless extension candidates. Maximal degree in co-relation 487. Up to 34 conditions per place. [2025-03-04 06:51:46,034 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 15 selfloop transitions, 2 changer transitions 0/472 dead transitions. [2025-03-04 06:51:46,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 472 transitions, 1005 flow [2025-03-04 06:51:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1404 transitions. [2025-03-04 06:51:46,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-03-04 06:51:46,038 INFO L175 Difference]: Start difference. First operand has 473 places, 471 transitions, 969 flow. Second operand 3 states and 1404 transitions. [2025-03-04 06:51:46,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 472 transitions, 1005 flow [2025-03-04 06:51:46,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 472 transitions, 985 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:46,048 INFO L231 Difference]: Finished difference. Result has 471 places, 472 transitions, 961 flow [2025-03-04 06:51:46,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=961, PETRI_PLACES=471, PETRI_TRANSITIONS=472} [2025-03-04 06:51:46,049 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -5 predicate places. [2025-03-04 06:51:46,049 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 472 transitions, 961 flow [2025-03-04 06:51:46,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:46,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:46,050 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] [2025-03-04 06:51:46,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:51:46,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:51:46,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:46,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1917540210, now seen corresponding path program 1 times [2025-03-04 06:51:46,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:46,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883861646] [2025-03-04 06:51:46,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:46,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:46,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 06:51:46,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 06:51:46,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:46,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:46,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:46,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883861646] [2025-03-04 06:51:46,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883861646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:46,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:46,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778672101] [2025-03-04 06:51:46,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:46,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:46,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:46,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:46,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:46,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 494 [2025-03-04 06:51:46,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 472 transitions, 961 flow. Second operand has 6 states, 6 states have (on average 371.6666666666667) internal successors, (2230), 6 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:46,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:46,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 494 [2025-03-04 06:51:46,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:47,128 INFO L124 PetriNetUnfolderBase]: 320/1802 cut-off events. [2025-03-04 06:51:47,128 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-03-04 06:51:47,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2563 conditions, 1802 events. 320/1802 cut-off events. For 16/24 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9899 event pairs, 288 based on Foata normal form. 0/1666 useless extension candidates. Maximal degree in co-relation 2286. Up to 738 conditions per place. [2025-03-04 06:51:47,137 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 103 selfloop transitions, 5 changer transitions 0/471 dead transitions. [2025-03-04 06:51:47,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 471 transitions, 1175 flow [2025-03-04 06:51:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2323 transitions. [2025-03-04 06:51:47,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837381916329285 [2025-03-04 06:51:47,143 INFO L175 Difference]: Start difference. First operand has 471 places, 472 transitions, 961 flow. Second operand 6 states and 2323 transitions. [2025-03-04 06:51:47,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 471 transitions, 1175 flow [2025-03-04 06:51:47,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 471 transitions, 1173 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:51:47,151 INFO L231 Difference]: Finished difference. Result has 474 places, 471 transitions, 967 flow [2025-03-04 06:51:47,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=967, PETRI_PLACES=474, PETRI_TRANSITIONS=471} [2025-03-04 06:51:47,153 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -2 predicate places. [2025-03-04 06:51:47,153 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 471 transitions, 967 flow [2025-03-04 06:51:47,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 371.6666666666667) internal successors, (2230), 6 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:47,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:47,155 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] [2025-03-04 06:51:47,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:51:47,155 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:51:47,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2115935445, now seen corresponding path program 1 times [2025-03-04 06:51:47,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:47,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510196319] [2025-03-04 06:51:47,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:47,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 06:51:47,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 06:51:47,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:47,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:47,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:47,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510196319] [2025-03-04 06:51:47,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510196319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:47,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:47,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:51:47,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794650424] [2025-03-04 06:51:47,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:47,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:47,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:47,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:47,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:47,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 494 [2025-03-04 06:51:47,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 471 transitions, 967 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:47,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:47,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 494 [2025-03-04 06:51:47,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:47,356 INFO L124 PetriNetUnfolderBase]: 15/835 cut-off events. [2025-03-04 06:51:47,357 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-04 06:51:47,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 835 events. 15/835 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1643 event pairs, 8 based on Foata normal form. 2/787 useless extension candidates. Maximal degree in co-relation 682. Up to 38 conditions per place. [2025-03-04 06:51:47,359 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 15 selfloop transitions, 2 changer transitions 0/472 dead transitions. [2025-03-04 06:51:47,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 472 transitions, 1003 flow [2025-03-04 06:51:47,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1404 transitions. [2025-03-04 06:51:47,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-03-04 06:51:47,366 INFO L175 Difference]: Start difference. First operand has 474 places, 471 transitions, 967 flow. Second operand 3 states and 1404 transitions. [2025-03-04 06:51:47,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 472 transitions, 1003 flow [2025-03-04 06:51:47,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 472 transitions, 993 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:47,374 INFO L231 Difference]: Finished difference. Result has 472 places, 472 transitions, 969 flow [2025-03-04 06:51:47,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=969, PETRI_PLACES=472, PETRI_TRANSITIONS=472} [2025-03-04 06:51:47,376 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -4 predicate places. [2025-03-04 06:51:47,376 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 472 transitions, 969 flow [2025-03-04 06:51:47,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:47,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:47,377 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] [2025-03-04 06:51:47,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:51:47,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:51:47,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:47,377 INFO L85 PathProgramCache]: Analyzing trace with hash 19709408, now seen corresponding path program 1 times [2025-03-04 06:51:47,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:47,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792032841] [2025-03-04 06:51:47,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:47,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:47,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 06:51:47,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 06:51:47,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:47,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:47,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792032841] [2025-03-04 06:51:47,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792032841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:47,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:47,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:47,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376179432] [2025-03-04 06:51:47,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:47,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:47,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:47,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:48,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 494 [2025-03-04 06:51:48,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 472 transitions, 969 flow. Second operand has 6 states, 6 states have (on average 410.5) internal successors, (2463), 6 states have internal predecessors, (2463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:48,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:48,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 494 [2025-03-04 06:51:48,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:48,556 INFO L124 PetriNetUnfolderBase]: 83/1145 cut-off events. [2025-03-04 06:51:48,556 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2025-03-04 06:51:48,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 1145 events. 83/1145 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3542 event pairs, 64 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 958. Up to 315 conditions per place. [2025-03-04 06:51:48,562 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 66 selfloop transitions, 5 changer transitions 0/471 dead transitions. [2025-03-04 06:51:48,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 471 transitions, 1109 flow [2025-03-04 06:51:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2508 transitions. [2025-03-04 06:51:48,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2025-03-04 06:51:48,569 INFO L175 Difference]: Start difference. First operand has 472 places, 472 transitions, 969 flow. Second operand 6 states and 2508 transitions. [2025-03-04 06:51:48,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 471 transitions, 1109 flow [2025-03-04 06:51:48,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 471 transitions, 1107 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:51:48,576 INFO L231 Difference]: Finished difference. Result has 475 places, 471 transitions, 975 flow [2025-03-04 06:51:48,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=975, PETRI_PLACES=475, PETRI_TRANSITIONS=471} [2025-03-04 06:51:48,578 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -1 predicate places. [2025-03-04 06:51:48,578 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 471 transitions, 975 flow [2025-03-04 06:51:48,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.5) internal successors, (2463), 6 states have internal predecessors, (2463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:48,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:48,580 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] [2025-03-04 06:51:48,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:51:48,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:51:48,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:48,581 INFO L85 PathProgramCache]: Analyzing trace with hash 587467578, now seen corresponding path program 1 times [2025-03-04 06:51:48,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:48,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420117961] [2025-03-04 06:51:48,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:48,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:48,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 06:51:48,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 06:51:48,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:48,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:48,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:48,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420117961] [2025-03-04 06:51:48,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420117961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:48,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:48,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:48,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805297914] [2025-03-04 06:51:48,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:49,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:49,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:49,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:49,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:49,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 494 [2025-03-04 06:51:49,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 471 transitions, 975 flow. Second operand has 6 states, 6 states have (on average 374.3333333333333) internal successors, (2246), 6 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:49,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:49,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 494 [2025-03-04 06:51:49,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:49,792 INFO L124 PetriNetUnfolderBase]: 320/1982 cut-off events. [2025-03-04 06:51:49,792 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-04 06:51:49,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1982 events. 320/1982 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10501 event pairs, 288 based on Foata normal form. 0/1846 useless extension candidates. Maximal degree in co-relation 2329. Up to 804 conditions per place. [2025-03-04 06:51:49,797 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 103 selfloop transitions, 5 changer transitions 0/470 dead transitions. [2025-03-04 06:51:49,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 470 transitions, 1189 flow [2025-03-04 06:51:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2323 transitions. [2025-03-04 06:51:49,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837381916329285 [2025-03-04 06:51:49,801 INFO L175 Difference]: Start difference. First operand has 475 places, 471 transitions, 975 flow. Second operand 6 states and 2323 transitions. [2025-03-04 06:51:49,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 470 transitions, 1189 flow [2025-03-04 06:51:49,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 470 transitions, 1179 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:49,806 INFO L231 Difference]: Finished difference. Result has 474 places, 470 transitions, 973 flow [2025-03-04 06:51:49,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=973, PETRI_PLACES=474, PETRI_TRANSITIONS=470} [2025-03-04 06:51:49,808 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -2 predicate places. [2025-03-04 06:51:49,808 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 470 transitions, 973 flow [2025-03-04 06:51:49,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 374.3333333333333) internal successors, (2246), 6 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:49,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:49,809 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] [2025-03-04 06:51:49,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:51:49,810 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:51:49,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:49,810 INFO L85 PathProgramCache]: Analyzing trace with hash -880772235, now seen corresponding path program 1 times [2025-03-04 06:51:49,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:49,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81300522] [2025-03-04 06:51:49,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:49,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:49,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 06:51:49,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 06:51:49,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:49,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:50,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:50,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81300522] [2025-03-04 06:51:50,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81300522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:50,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:50,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:50,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430958030] [2025-03-04 06:51:50,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:50,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:50,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:50,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:50,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:50,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 494 [2025-03-04 06:51:50,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 470 transitions, 973 flow. Second operand has 6 states, 6 states have (on average 379.0) internal successors, (2274), 6 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:50,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:50,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 494 [2025-03-04 06:51:50,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:50,776 INFO L124 PetriNetUnfolderBase]: 320/1978 cut-off events. [2025-03-04 06:51:50,777 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-04 06:51:50,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 1978 events. 320/1978 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10485 event pairs, 288 based on Foata normal form. 0/1846 useless extension candidates. Maximal degree in co-relation 2345. Up to 788 conditions per place. [2025-03-04 06:51:50,784 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 99 selfloop transitions, 5 changer transitions 0/469 dead transitions. [2025-03-04 06:51:50,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 469 transitions, 1179 flow [2025-03-04 06:51:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2343 transitions. [2025-03-04 06:51:50,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904858299595142 [2025-03-04 06:51:50,789 INFO L175 Difference]: Start difference. First operand has 474 places, 470 transitions, 973 flow. Second operand 6 states and 2343 transitions. [2025-03-04 06:51:50,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 469 transitions, 1179 flow [2025-03-04 06:51:50,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 469 transitions, 1169 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:50,796 INFO L231 Difference]: Finished difference. Result has 473 places, 469 transitions, 971 flow [2025-03-04 06:51:50,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=971, PETRI_PLACES=473, PETRI_TRANSITIONS=469} [2025-03-04 06:51:50,800 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -3 predicate places. [2025-03-04 06:51:50,800 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 469 transitions, 971 flow [2025-03-04 06:51:50,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.0) internal successors, (2274), 6 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:50,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:50,801 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] [2025-03-04 06:51:50,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:51:50,802 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:51:50,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1699201572, now seen corresponding path program 1 times [2025-03-04 06:51:50,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:50,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33790621] [2025-03-04 06:51:50,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:50,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:50,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 06:51:50,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 06:51:50,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:50,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:51:51,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:51,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33790621] [2025-03-04 06:51:51,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33790621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:51,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:51,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:51,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361228536] [2025-03-04 06:51:51,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:51,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:51,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:51,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:51,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:51,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 494 [2025-03-04 06:51:51,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 469 transitions, 971 flow. Second operand has 6 states, 6 states have (on average 379.0) internal successors, (2274), 6 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:51,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:51,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 494 [2025-03-04 06:51:51,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:52,048 INFO L124 PetriNetUnfolderBase]: 320/1974 cut-off events. [2025-03-04 06:51:52,049 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-04 06:51:52,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2823 conditions, 1974 events. 320/1974 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10440 event pairs, 288 based on Foata normal form. 0/1846 useless extension candidates. Maximal degree in co-relation 2360. Up to 788 conditions per place. [2025-03-04 06:51:52,057 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 99 selfloop transitions, 5 changer transitions 0/468 dead transitions. [2025-03-04 06:51:52,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 468 transitions, 1177 flow [2025-03-04 06:51:52,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2343 transitions. [2025-03-04 06:51:52,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904858299595142 [2025-03-04 06:51:52,062 INFO L175 Difference]: Start difference. First operand has 473 places, 469 transitions, 971 flow. Second operand 6 states and 2343 transitions. [2025-03-04 06:51:52,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 468 transitions, 1177 flow [2025-03-04 06:51:52,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 468 transitions, 1167 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:52,067 INFO L231 Difference]: Finished difference. Result has 472 places, 468 transitions, 969 flow [2025-03-04 06:51:52,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=969, PETRI_PLACES=472, PETRI_TRANSITIONS=468} [2025-03-04 06:51:52,069 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -4 predicate places. [2025-03-04 06:51:52,069 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 468 transitions, 969 flow [2025-03-04 06:51:52,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.0) internal successors, (2274), 6 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:52,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:52,070 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] [2025-03-04 06:51:52,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:51:52,070 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:51:52,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:52,071 INFO L85 PathProgramCache]: Analyzing trace with hash -924732901, now seen corresponding path program 1 times [2025-03-04 06:51:52,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:52,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399418198] [2025-03-04 06:51:52,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:52,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:52,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-04 06:51:52,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-04 06:51:52,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:52,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:51:52,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:52,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399418198] [2025-03-04 06:51:52,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399418198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:52,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:52,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540432923] [2025-03-04 06:51:52,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:52,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:52,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:52,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:52,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:53,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 494 [2025-03-04 06:51:53,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 468 transitions, 969 flow. Second operand has 6 states, 6 states have (on average 375.5) internal successors, (2253), 6 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:53,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:53,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 494 [2025-03-04 06:51:53,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:53,439 INFO L124 PetriNetUnfolderBase]: 320/1970 cut-off events. [2025-03-04 06:51:53,440 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-04 06:51:53,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2839 conditions, 1970 events. 320/1970 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10453 event pairs, 288 based on Foata normal form. 0/1846 useless extension candidates. Maximal degree in co-relation 2373. Up to 808 conditions per place. [2025-03-04 06:51:53,450 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 104 selfloop transitions, 5 changer transitions 0/467 dead transitions. [2025-03-04 06:51:53,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 467 transitions, 1185 flow [2025-03-04 06:51:53,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2318 transitions. [2025-03-04 06:51:53,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.782051282051282 [2025-03-04 06:51:53,456 INFO L175 Difference]: Start difference. First operand has 472 places, 468 transitions, 969 flow. Second operand 6 states and 2318 transitions. [2025-03-04 06:51:53,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 467 transitions, 1185 flow [2025-03-04 06:51:53,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 467 transitions, 1175 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:53,464 INFO L231 Difference]: Finished difference. Result has 471 places, 467 transitions, 967 flow [2025-03-04 06:51:53,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=967, PETRI_PLACES=471, PETRI_TRANSITIONS=467} [2025-03-04 06:51:53,466 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, -5 predicate places. [2025-03-04 06:51:53,466 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 467 transitions, 967 flow [2025-03-04 06:51:53,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.5) internal successors, (2253), 6 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:53,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:53,468 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:53,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:51:53,468 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:51:53,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:53,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1594145177, now seen corresponding path program 1 times [2025-03-04 06:51:53,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:53,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855854839] [2025-03-04 06:51:53,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:53,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:53,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-04 06:51:53,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-04 06:51:53,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:53,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:51:53,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:53,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855854839] [2025-03-04 06:51:53,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855854839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:51:53,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515796172] [2025-03-04 06:51:53,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:53,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:51:53,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:51:53,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:51:53,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:51:53,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-04 06:51:53,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-04 06:51:53,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:53,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:53,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:51:53,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:51:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:51:53,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:51:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:51:54,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515796172] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:51:54,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:51:54,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:51:54,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984345090] [2025-03-04 06:51:54,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:51:54,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:51:54,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:54,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:51:54,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:51:54,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 494 [2025-03-04 06:51:54,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 467 transitions, 967 flow. Second operand has 10 states, 10 states have (on average 460.8) internal successors, (4608), 10 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:54,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:54,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 494 [2025-03-04 06:51:54,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:54,298 INFO L124 PetriNetUnfolderBase]: 15/999 cut-off events. [2025-03-04 06:51:54,298 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-04 06:51:54,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1113 conditions, 999 events. 15/999 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1194 event pairs, 8 based on Foata normal form. 4/973 useless extension candidates. Maximal degree in co-relation 888. Up to 38 conditions per place. [2025-03-04 06:51:54,300 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 19 selfloop transitions, 9 changer transitions 0/475 dead transitions. [2025-03-04 06:51:54,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 475 transitions, 1041 flow [2025-03-04 06:51:54,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:51:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:51:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4161 transitions. [2025-03-04 06:51:54,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9358974358974359 [2025-03-04 06:51:54,308 INFO L175 Difference]: Start difference. First operand has 471 places, 467 transitions, 967 flow. Second operand 9 states and 4161 transitions. [2025-03-04 06:51:54,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 475 transitions, 1041 flow [2025-03-04 06:51:54,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 475 transitions, 1031 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:54,315 INFO L231 Difference]: Finished difference. Result has 477 places, 473 transitions, 1007 flow [2025-03-04 06:51:54,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1007, PETRI_PLACES=477, PETRI_TRANSITIONS=473} [2025-03-04 06:51:54,316 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 1 predicate places. [2025-03-04 06:51:54,316 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 473 transitions, 1007 flow [2025-03-04 06:51:54,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 460.8) internal successors, (4608), 10 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:54,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:54,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:54,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:51:54,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 06:51:54,520 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:51:54,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:54,525 INFO L85 PathProgramCache]: Analyzing trace with hash -562622987, now seen corresponding path program 2 times [2025-03-04 06:51:54,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:54,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615971322] [2025-03-04 06:51:54,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:51:54,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:54,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 422 statements into 2 equivalence classes. [2025-03-04 06:51:54,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 123 of 422 statements. [2025-03-04 06:51:54,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:51:54,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2025-03-04 06:51:54,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:54,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615971322] [2025-03-04 06:51:54,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615971322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:54,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:54,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:54,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66545596] [2025-03-04 06:51:54,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:54,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:54,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:54,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:55,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 494 [2025-03-04 06:51:55,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 473 transitions, 1007 flow. Second operand has 6 states, 6 states have (on average 404.3333333333333) internal successors, (2426), 6 states have internal predecessors, (2426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:55,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:55,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 494 [2025-03-04 06:51:55,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:56,003 INFO L124 PetriNetUnfolderBase]: 83/1311 cut-off events. [2025-03-04 06:51:56,003 INFO L125 PetriNetUnfolderBase]: For 18/22 co-relation queries the response was YES. [2025-03-04 06:51:56,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 1311 events. 83/1311 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3072 event pairs, 64 based on Foata normal form. 0/1238 useless extension candidates. Maximal degree in co-relation 1087. Up to 362 conditions per place. [2025-03-04 06:51:56,007 INFO L140 encePairwiseOnDemand]: 482/494 looper letters, 69 selfloop transitions, 10 changer transitions 0/471 dead transitions. [2025-03-04 06:51:56,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 471 transitions, 1161 flow [2025-03-04 06:51:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2463 transitions. [2025-03-04 06:51:56,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8309716599190283 [2025-03-04 06:51:56,010 INFO L175 Difference]: Start difference. First operand has 477 places, 473 transitions, 1007 flow. Second operand 6 states and 2463 transitions. [2025-03-04 06:51:56,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 471 transitions, 1161 flow [2025-03-04 06:51:56,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 471 transitions, 1155 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:51:56,016 INFO L231 Difference]: Finished difference. Result has 479 places, 471 transitions, 1017 flow [2025-03-04 06:51:56,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1017, PETRI_PLACES=479, PETRI_TRANSITIONS=471} [2025-03-04 06:51:56,017 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 3 predicate places. [2025-03-04 06:51:56,017 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 471 transitions, 1017 flow [2025-03-04 06:51:56,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.3333333333333) internal successors, (2426), 6 states have internal predecessors, (2426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:56,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:56,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:56,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:51:56,019 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:51:56,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:56,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1765512560, now seen corresponding path program 1 times [2025-03-04 06:51:56,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:56,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654062849] [2025-03-04 06:51:56,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:56,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:56,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-04 06:51:56,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-04 06:51:56,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:56,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2025-03-04 06:51:56,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:56,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654062849] [2025-03-04 06:51:56,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654062849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:51:56,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867381351] [2025-03-04 06:51:56,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:56,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:51:56,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:51:56,303 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:51:56,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:51:56,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-04 06:51:56,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-04 06:51:56,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:56,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:56,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:51:56,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:51:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 1 proven. 399 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 06:51:56,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:51:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 1 proven. 399 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 06:51:57,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867381351] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:51:57,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:51:57,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 06:51:57,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45745445] [2025-03-04 06:51:57,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:51:57,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 06:51:57,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:57,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 06:51:57,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-04 06:51:57,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 494 [2025-03-04 06:51:57,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 471 transitions, 1017 flow. Second operand has 19 states, 19 states have (on average 455.5263157894737) internal successors, (8655), 19 states have internal predecessors, (8655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:57,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:57,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 494 [2025-03-04 06:51:57,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:58,487 INFO L124 PetriNetUnfolderBase]: 16/2377 cut-off events. [2025-03-04 06:51:58,487 INFO L125 PetriNetUnfolderBase]: For 81/82 co-relation queries the response was YES. [2025-03-04 06:51:58,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 2377 events. 16/2377 cut-off events. For 81/82 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1188 event pairs, 8 based on Foata normal form. 13/2362 useless extension candidates. Maximal degree in co-relation 2450. Up to 40 conditions per place. [2025-03-04 06:51:58,492 INFO L140 encePairwiseOnDemand]: 483/494 looper letters, 51 selfloop transitions, 68 changer transitions 0/557 dead transitions. [2025-03-04 06:51:58,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 557 transitions, 1665 flow [2025-03-04 06:51:58,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 06:51:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-04 06:51:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 28671 transitions. [2025-03-04 06:51:58,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212454212454212 [2025-03-04 06:51:58,512 INFO L175 Difference]: Start difference. First operand has 479 places, 471 transitions, 1017 flow. Second operand 63 states and 28671 transitions. [2025-03-04 06:51:58,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 557 transitions, 1665 flow [2025-03-04 06:51:58,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 557 transitions, 1645 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:51:58,519 INFO L231 Difference]: Finished difference. Result has 552 places, 533 transitions, 1517 flow [2025-03-04 06:51:58,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1517, PETRI_PLACES=552, PETRI_TRANSITIONS=533} [2025-03-04 06:51:58,520 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 76 predicate places. [2025-03-04 06:51:58,520 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 533 transitions, 1517 flow [2025-03-04 06:51:58,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 455.5263157894737) internal successors, (8655), 19 states have internal predecessors, (8655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:58,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:58,523 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:51:58,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 06:51:58,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 06:51:58,723 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:51:58,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1780035740, now seen corresponding path program 2 times [2025-03-04 06:51:58,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:58,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43618684] [2025-03-04 06:51:58,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:51:58,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:58,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1484 statements into 2 equivalence classes. [2025-03-04 06:51:58,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 166 of 1484 statements. [2025-03-04 06:51:58,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:51:58,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12365 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12365 trivial. 0 not checked. [2025-03-04 06:51:59,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:59,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43618684] [2025-03-04 06:51:59,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43618684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:59,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:59,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:59,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926403025] [2025-03-04 06:51:59,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:59,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:59,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:59,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:59,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:59,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 494 [2025-03-04 06:51:59,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 533 transitions, 1517 flow. Second operand has 6 states, 6 states have (on average 413.3333333333333) internal successors, (2480), 6 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:51:59,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:59,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 494 [2025-03-04 06:51:59,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:00,473 INFO L124 PetriNetUnfolderBase]: 103/2776 cut-off events. [2025-03-04 06:52:00,473 INFO L125 PetriNetUnfolderBase]: For 441/446 co-relation queries the response was YES. [2025-03-04 06:52:00,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3946 conditions, 2776 events. 103/2776 cut-off events. For 441/446 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4010 event pairs, 80 based on Foata normal form. 0/2694 useless extension candidates. Maximal degree in co-relation 3132. Up to 823 conditions per place. [2025-03-04 06:52:00,491 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 66 selfloop transitions, 5 changer transitions 0/532 dead transitions. [2025-03-04 06:52:00,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 532 transitions, 1657 flow [2025-03-04 06:52:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:52:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:52:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2508 transitions. [2025-03-04 06:52:00,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2025-03-04 06:52:00,494 INFO L175 Difference]: Start difference. First operand has 552 places, 533 transitions, 1517 flow. Second operand 6 states and 2508 transitions. [2025-03-04 06:52:00,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 532 transitions, 1657 flow [2025-03-04 06:52:00,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 532 transitions, 1581 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-04 06:52:00,503 INFO L231 Difference]: Finished difference. Result has 549 places, 532 transitions, 1449 flow [2025-03-04 06:52:00,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1449, PETRI_PLACES=549, PETRI_TRANSITIONS=532} [2025-03-04 06:52:00,505 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 73 predicate places. [2025-03-04 06:52:00,505 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 532 transitions, 1449 flow [2025-03-04 06:52:00,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 413.3333333333333) internal successors, (2480), 6 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:00,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:00,506 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:00,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:52:00,506 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:52:00,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:00,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1761338453, now seen corresponding path program 1 times [2025-03-04 06:52:00,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:00,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262144788] [2025-03-04 06:52:00,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:00,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:00,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-03-04 06:52:00,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-03-04 06:52:00,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:00,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12365 backedges. 6508 proven. 2779 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [2025-03-04 06:52:02,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:02,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262144788] [2025-03-04 06:52:02,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262144788] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:52:02,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41098441] [2025-03-04 06:52:02,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:02,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:52:02,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:52:02,826 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-03-04 06:52:02,828 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-03-04 06:52:03,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-03-04 06:52:03,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-03-04 06:52:03,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:03,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:03,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 5801 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:52:03,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:52:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12365 backedges. 6508 proven. 2779 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [2025-03-04 06:52:04,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:52:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12365 backedges. 6508 proven. 2779 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [2025-03-04 06:52:05,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41098441] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:52:05,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:52:05,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-04 06:52:05,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536764453] [2025-03-04 06:52:05,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:52:05,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 06:52:05,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:05,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 06:52:05,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 06:52:05,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 494 [2025-03-04 06:52:05,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 532 transitions, 1449 flow. Second operand has 34 states, 34 states have (on average 461.11764705882354) internal successors, (15678), 34 states have internal predecessors, (15678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:05,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:05,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 494 [2025-03-04 06:52:05,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:06,944 INFO L124 PetriNetUnfolderBase]: 16/4536 cut-off events. [2025-03-04 06:52:06,944 INFO L125 PetriNetUnfolderBase]: For 3212/3213 co-relation queries the response was YES. [2025-03-04 06:52:06,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5332 conditions, 4536 events. 16/4536 cut-off events. For 3212/3213 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1187 event pairs, 8 based on Foata normal form. 24/4533 useless extension candidates. Maximal degree in co-relation 5088. Up to 78 conditions per place. [2025-03-04 06:52:06,952 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 51 selfloop transitions, 135 changer transitions 0/633 dead transitions. [2025-03-04 06:52:06,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 633 transitions, 2585 flow [2025-03-04 06:52:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 06:52:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-04 06:52:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 20739 transitions. [2025-03-04 06:52:06,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9329284750337382 [2025-03-04 06:52:06,960 INFO L175 Difference]: Start difference. First operand has 549 places, 532 transitions, 1449 flow. Second operand 45 states and 20739 transitions. [2025-03-04 06:52:06,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 633 transitions, 2585 flow [2025-03-04 06:52:06,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 633 transitions, 2575 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:52:06,971 INFO L231 Difference]: Finished difference. Result has 597 places, 607 transitions, 2313 flow [2025-03-04 06:52:06,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2313, PETRI_PLACES=597, PETRI_TRANSITIONS=607} [2025-03-04 06:52:06,972 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 121 predicate places. [2025-03-04 06:52:06,972 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 607 transitions, 2313 flow [2025-03-04 06:52:06,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 461.11764705882354) internal successors, (15678), 34 states have internal predecessors, (15678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:06,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:06,976 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:06,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 06:52:07,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:52:07,177 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:52:07,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:07,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1371626923, now seen corresponding path program 2 times [2025-03-04 06:52:07,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:07,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354093282] [2025-03-04 06:52:07,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:52:07,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:07,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2931 statements into 2 equivalence classes. [2025-03-04 06:52:07,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 173 of 2931 statements. [2025-03-04 06:52:07,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:52:07,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 58141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58141 trivial. 0 not checked. [2025-03-04 06:52:07,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:07,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354093282] [2025-03-04 06:52:07,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354093282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:07,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:07,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:52:07,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509301893] [2025-03-04 06:52:07,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:07,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:52:07,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:07,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:52:07,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:52:08,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 494 [2025-03-04 06:52:08,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 607 transitions, 2313 flow. Second operand has 6 states, 6 states have (on average 378.1666666666667) internal successors, (2269), 6 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:08,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:08,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 494 [2025-03-04 06:52:08,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:10,832 INFO L124 PetriNetUnfolderBase]: 360/5838 cut-off events. [2025-03-04 06:52:10,832 INFO L125 PetriNetUnfolderBase]: For 1234/1243 co-relation queries the response was YES. [2025-03-04 06:52:10,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8836 conditions, 5838 events. 360/5838 cut-off events. For 1234/1243 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 11869 event pairs, 324 based on Foata normal form. 0/5706 useless extension candidates. Maximal degree in co-relation 6602. Up to 2196 conditions per place. [2025-03-04 06:52:10,853 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 104 selfloop transitions, 5 changer transitions 0/606 dead transitions. [2025-03-04 06:52:10,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 606 transitions, 2529 flow [2025-03-04 06:52:10,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:52:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:52:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2318 transitions. [2025-03-04 06:52:10,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.782051282051282 [2025-03-04 06:52:10,859 INFO L175 Difference]: Start difference. First operand has 597 places, 607 transitions, 2313 flow. Second operand 6 states and 2318 transitions. [2025-03-04 06:52:10,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 606 transitions, 2529 flow [2025-03-04 06:52:10,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 606 transitions, 2421 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-04 06:52:10,880 INFO L231 Difference]: Finished difference. Result has 583 places, 606 transitions, 2213 flow [2025-03-04 06:52:10,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=2203, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2213, PETRI_PLACES=583, PETRI_TRANSITIONS=606} [2025-03-04 06:52:10,883 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 107 predicate places. [2025-03-04 06:52:10,883 INFO L471 AbstractCegarLoop]: Abstraction has has 583 places, 606 transitions, 2213 flow [2025-03-04 06:52:10,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 378.1666666666667) internal successors, (2269), 6 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:10,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:10,885 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:10,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:52:10,885 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:52:10,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash 172510926, now seen corresponding path program 1 times [2025-03-04 06:52:10,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:10,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853558255] [2025-03-04 06:52:10,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:10,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:11,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-03-04 06:52:11,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-03-04 06:52:11,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:11,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:14,171 INFO L134 CoverageAnalysis]: Checked inductivity of 58141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58141 trivial. 0 not checked. [2025-03-04 06:52:14,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:14,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853558255] [2025-03-04 06:52:14,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853558255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:14,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:14,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:52:14,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900758126] [2025-03-04 06:52:14,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:14,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:52:14,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:14,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:52:14,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:52:14,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 494 [2025-03-04 06:52:14,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 606 transitions, 2213 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:14,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:14,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 494 [2025-03-04 06:52:14,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:16,665 INFO L124 PetriNetUnfolderBase]: 46/4808 cut-off events. [2025-03-04 06:52:16,665 INFO L125 PetriNetUnfolderBase]: For 1202/1206 co-relation queries the response was YES. [2025-03-04 06:52:16,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5644 conditions, 4808 events. 46/4808 cut-off events. For 1202/1206 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3040 event pairs, 24 based on Foata normal form. 2/4741 useless extension candidates. Maximal degree in co-relation 5041. Up to 78 conditions per place. [2025-03-04 06:52:16,688 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 22 selfloop transitions, 2 changer transitions 0/614 dead transitions. [2025-03-04 06:52:16,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 614 transitions, 2277 flow [2025-03-04 06:52:16,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:52:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:52:16,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1411 transitions. [2025-03-04 06:52:16,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520917678812416 [2025-03-04 06:52:16,691 INFO L175 Difference]: Start difference. First operand has 583 places, 606 transitions, 2213 flow. Second operand 3 states and 1411 transitions. [2025-03-04 06:52:16,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 614 transitions, 2277 flow [2025-03-04 06:52:16,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 614 transitions, 2267 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:52:16,708 INFO L231 Difference]: Finished difference. Result has 581 places, 606 transitions, 2211 flow [2025-03-04 06:52:16,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=2203, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2211, PETRI_PLACES=581, PETRI_TRANSITIONS=606} [2025-03-04 06:52:16,709 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 105 predicate places. [2025-03-04 06:52:16,709 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 606 transitions, 2211 flow [2025-03-04 06:52:16,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:16,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:16,711 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:16,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:52:16,712 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:52:16,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:16,722 INFO L85 PathProgramCache]: Analyzing trace with hash 109410050, now seen corresponding path program 1 times [2025-03-04 06:52:16,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:16,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365543105] [2025-03-04 06:52:16,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:16,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:17,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-03-04 06:52:17,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-03-04 06:52:17,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:17,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 58141 backedges. 29756 proven. 13875 refuted. 0 times theorem prover too weak. 14510 trivial. 0 not checked. [2025-03-04 06:52:25,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:25,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365543105] [2025-03-04 06:52:25,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365543105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:52:25,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500539692] [2025-03-04 06:52:25,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:25,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:52:25,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:52:25,250 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-03-04 06:52:25,252 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-03-04 06:52:26,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-03-04 06:52:27,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-03-04 06:52:27,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:27,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:27,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 11747 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 06:52:27,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:52:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 58141 backedges. 29756 proven. 13875 refuted. 0 times theorem prover too weak. 14510 trivial. 0 not checked. [2025-03-04 06:52:28,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:52:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 58141 backedges. 29756 proven. 13875 refuted. 0 times theorem prover too weak. 14510 trivial. 0 not checked. [2025-03-04 06:52:30,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500539692] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:52:30,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:52:30,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-04 06:52:30,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286783867] [2025-03-04 06:52:30,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:52:30,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-04 06:52:30,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:30,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-04 06:52:30,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 06:52:30,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 494 [2025-03-04 06:52:30,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 606 transitions, 2211 flow. Second operand has 63 states, 63 states have (on average 461.0952380952381) internal successors, (29049), 63 states have internal predecessors, (29049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:30,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:30,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 494 [2025-03-04 06:52:30,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:36,554 INFO L124 PetriNetUnfolderBase]: 15/8582 cut-off events. [2025-03-04 06:52:36,554 INFO L125 PetriNetUnfolderBase]: For 13377/13378 co-relation queries the response was YES. [2025-03-04 06:52:36,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10497 conditions, 8582 events. 15/8582 cut-off events. For 13377/13378 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1226 event pairs, 8 based on Foata normal form. 45/8603 useless extension candidates. Maximal degree in co-relation 10223. Up to 168 conditions per place. [2025-03-04 06:52:36,568 INFO L140 encePairwiseOnDemand]: 488/494 looper letters, 96 selfloop transitions, 270 changer transitions 0/812 dead transitions. [2025-03-04 06:52:36,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 812 transitions, 5129 flow [2025-03-04 06:52:36,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-04 06:52:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-04 06:52:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 41461 transitions. [2025-03-04 06:52:36,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9325461088618984 [2025-03-04 06:52:36,599 INFO L175 Difference]: Start difference. First operand has 581 places, 606 transitions, 2211 flow. Second operand 90 states and 41461 transitions. [2025-03-04 06:52:36,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 812 transitions, 5129 flow [2025-03-04 06:52:36,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 812 transitions, 5125 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:52:36,626 INFO L231 Difference]: Finished difference. Result has 684 places, 744 transitions, 4199 flow [2025-03-04 06:52:36,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=2207, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4199, PETRI_PLACES=684, PETRI_TRANSITIONS=744} [2025-03-04 06:52:36,627 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 208 predicate places. [2025-03-04 06:52:36,627 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 744 transitions, 4199 flow [2025-03-04 06:52:36,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 461.0952380952381) internal successors, (29049), 63 states have internal predecessors, (29049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:36,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:36,634 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:36,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 06:52:36,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 06:52:36,835 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:52:36,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:36,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1758399554, now seen corresponding path program 2 times [2025-03-04 06:52:36,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:36,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157406526] [2025-03-04 06:52:36,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:52:36,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:37,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5645 statements into 2 equivalence classes. [2025-03-04 06:52:37,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 185 of 5645 statements. [2025-03-04 06:52:37,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:52:37,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 236314 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236314 trivial. 0 not checked. [2025-03-04 06:52:38,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:38,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157406526] [2025-03-04 06:52:38,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157406526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:38,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:38,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:52:38,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647010259] [2025-03-04 06:52:38,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:38,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:52:38,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:38,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:52:38,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:52:38,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 494 [2025-03-04 06:52:38,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 744 transitions, 4199 flow. Second operand has 6 states, 6 states have (on average 376.8333333333333) internal successors, (2261), 6 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:38,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:38,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 494 [2025-03-04 06:52:38,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:52:48,100 INFO L124 PetriNetUnfolderBase]: 739/11137 cut-off events. [2025-03-04 06:52:48,101 INFO L125 PetriNetUnfolderBase]: For 3557/3571 co-relation queries the response was YES. [2025-03-04 06:52:48,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17531 conditions, 11137 events. 739/11137 cut-off events. For 3557/3571 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 22704 event pairs, 323 based on Foata normal form. 4/10894 useless extension candidates. Maximal degree in co-relation 13194. Up to 4140 conditions per place. [2025-03-04 06:52:48,138 INFO L140 encePairwiseOnDemand]: 459/494 looper letters, 143 selfloop transitions, 118 changer transitions 0/893 dead transitions. [2025-03-04 06:52:48,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 893 transitions, 5020 flow [2025-03-04 06:52:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:52:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:52:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2458 transitions. [2025-03-04 06:52:48,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8292847503373819 [2025-03-04 06:52:48,140 INFO L175 Difference]: Start difference. First operand has 684 places, 744 transitions, 4199 flow. Second operand 6 states and 2458 transitions. [2025-03-04 06:52:48,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 893 transitions, 5020 flow [2025-03-04 06:52:48,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 893 transitions, 4666 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-04 06:52:48,172 INFO L231 Difference]: Finished difference. Result has 652 places, 861 transitions, 4620 flow [2025-03-04 06:52:48,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=494, PETRI_DIFFERENCE_MINUEND_FLOW=3845, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=710, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4620, PETRI_PLACES=652, PETRI_TRANSITIONS=861} [2025-03-04 06:52:48,174 INFO L279 CegarLoopForPetriNet]: 476 programPoint places, 176 predicate places. [2025-03-04 06:52:48,174 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 861 transitions, 4620 flow [2025-03-04 06:52:48,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 376.8333333333333) internal successors, (2261), 6 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:48,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:52:48,175 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:52:48,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:52:48,176 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:52:48,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:52:48,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1140597947, now seen corresponding path program 1 times [2025-03-04 06:52:48,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:52:48,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602096591] [2025-03-04 06:52:48,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:52:48,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:52:48,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5659 statements into 1 equivalence classes. [2025-03-04 06:52:49,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5659 of 5659 statements. [2025-03-04 06:52:49,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:52:49,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:52:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 236314 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236314 trivial. 0 not checked. [2025-03-04 06:52:58,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:52:58,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602096591] [2025-03-04 06:52:58,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602096591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:52:58,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:52:58,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:52:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693137897] [2025-03-04 06:52:58,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:52:58,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:52:58,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:52:58,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:52:58,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:52:58,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 494 [2025-03-04 06:52:58,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 861 transitions, 4620 flow. Second operand has 5 states, 5 states have (on average 461.6) internal successors, (2308), 5 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:52:58,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:52:58,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 494 [2025-03-04 06:52:58,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand