./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_24-evilcollapse_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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/09-regions_24-evilcollapse_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 085e9170c725dbfce47ad23ff96af1e2e4188372955794675158fde45968fe8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:17:59,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:17:59,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:17:59,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:17:59,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:17:59,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:17:59,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:17:59,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:17:59,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:17:59,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:17:59,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:17:59,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:17:59,815 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:17:59,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:17:59,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:17:59,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:17:59,816 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:17:59,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:17:59,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:17:59,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:17:59,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:17:59,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:17:59,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:17:59,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:17:59,816 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 -> 085e9170c725dbfce47ad23ff96af1e2e4188372955794675158fde45968fe8a [2025-03-13 22:18:00,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:18:00,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:18:00,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:18:00,024 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:18:00,024 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:18:00,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_24-evilcollapse_nr.i [2025-03-13 22:18:01,144 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ff84b99/549d993a9d1b4ef9b5fb77543f1a5a35/FLAGbb67f5902 [2025-03-13 22:18:01,450 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:18:01,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_24-evilcollapse_nr.i [2025-03-13 22:18:01,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ff84b99/549d993a9d1b4ef9b5fb77543f1a5a35/FLAGbb67f5902 [2025-03-13 22:18:01,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ff84b99/549d993a9d1b4ef9b5fb77543f1a5a35 [2025-03-13 22:18:01,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:18:01,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:18:01,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:18:01,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:18:01,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:18:01,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:18:01" (1/1) ... [2025-03-13 22:18:01,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63171e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:18:01, skipping insertion in model container [2025-03-13 22:18:01,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:18:01" (1/1) ... [2025-03-13 22:18:01,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:18:02,074 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:18:02,075 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:18:02,075 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:18:02,076 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:18:02,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:18:02,128 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:18:02,167 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:18:02,170 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:18:02,171 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:18:02,171 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:18:02,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:18:02,235 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:18:02,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:18:02 WrapperNode [2025-03-13 22:18:02,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:18:02,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:18:02,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:18:02,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:18:02,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:18:02" (1/1) ... [2025-03-13 22:18:02,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:18:02" (1/1) ... [2025-03-13 22:18:02,285 INFO L138 Inliner]: procedures = 275, calls = 101, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 309 [2025-03-13 22:18:02,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:18:02,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:18:02,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:18:02,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:18:02,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:18:02" (1/1) ... [2025-03-13 22:18:02,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:18:02" (1/1) ... [2025-03-13 22:18:02,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:18:02" (1/1) ... [2025-03-13 22:18:02,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:18:02" (1/1) ... [2025-03-13 22:18:02,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:18:02" (1/1) ... [2025-03-13 22:18:02,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:18:02" (1/1) ... [2025-03-13 22:18:02,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:18:02" (1/1) ... [2025-03-13 22:18:02,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:18:02" (1/1) ... [2025-03-13 22:18:02,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:18:02,322 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:18:02,322 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:18:02,322 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:18:02,323 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:18:02" (1/1) ... [2025-03-13 22:18:02,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:18:02,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:18:02,357 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-13 22:18:02,366 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-13 22:18:02,384 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-13 22:18:02,385 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-13 22:18:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:18:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-13 22:18:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:18:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:18:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:18:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:18:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:18:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:18:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:18:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:18:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:18:02,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:18:02,387 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:18:02,508 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:18:02,510 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:18:02,915 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:18:02,916 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:18:02,916 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:18:02,939 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:18:02,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:18:02 BoogieIcfgContainer [2025-03-13 22:18:02,940 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:18:02,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:18:02,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:18:02,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:18:02,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:18:01" (1/3) ... [2025-03-13 22:18:02,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89443b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:18:02, skipping insertion in model container [2025-03-13 22:18:02,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:18:02" (2/3) ... [2025-03-13 22:18:02,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89443b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:18:02, skipping insertion in model container [2025-03-13 22:18:02,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:18:02" (3/3) ... [2025-03-13 22:18:02,948 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_24-evilcollapse_nr.i [2025-03-13 22:18:02,961 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:18:02,963 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_24-evilcollapse_nr.i that has 2 procedures, 357 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-03-13 22:18:02,963 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:18:03,064 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:18:03,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 429 places, 433 transitions, 874 flow [2025-03-13 22:18:03,206 INFO L124 PetriNetUnfolderBase]: 11/431 cut-off events. [2025-03-13 22:18:03,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:18:03,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 431 events. 11/431 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 807 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 358. Up to 2 conditions per place. [2025-03-13 22:18:03,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 429 places, 433 transitions, 874 flow [2025-03-13 22:18:03,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 427 places, 431 transitions, 868 flow [2025-03-13 22:18:03,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:18:03,246 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;@16878950, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:18:03,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-13 22:18:03,269 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:18:03,269 INFO L124 PetriNetUnfolderBase]: 0/113 cut-off events. [2025-03-13 22:18:03,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:18:03,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:03,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:18:03,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:03,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:03,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1346369321, now seen corresponding path program 1 times [2025-03-13 22:18:03,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:03,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942686] [2025-03-13 22:18:03,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:03,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-13 22:18:03,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 22:18:03,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:03,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:04,324 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-13 22:18:04,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942686] [2025-03-13 22:18:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:04,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:04,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143856231] [2025-03-13 22:18:04,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:04,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:04,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:04,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:04,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:04,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 433 [2025-03-13 22:18:04,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 431 transitions, 868 flow. Second operand has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 0 states have call successors, (0), 0 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-13 22:18:04,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:04,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 433 [2025-03-13 22:18:04,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:05,220 INFO L124 PetriNetUnfolderBase]: 450/1903 cut-off events. [2025-03-13 22:18:05,220 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-13 22:18:05,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2810 conditions, 1903 events. 450/1903 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11464 event pairs, 342 based on Foata normal form. 36/1727 useless extension candidates. Maximal degree in co-relation 2472. Up to 854 conditions per place. [2025-03-13 22:18:05,237 INFO L140 encePairwiseOnDemand]: 417/433 looper letters, 80 selfloop transitions, 10 changer transitions 2/425 dead transitions. [2025-03-13 22:18:05,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 425 transitions, 1036 flow [2025-03-13 22:18:05,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2118 transitions. [2025-03-13 22:18:05,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.815242494226328 [2025-03-13 22:18:05,260 INFO L175 Difference]: Start difference. First operand has 427 places, 431 transitions, 868 flow. Second operand 6 states and 2118 transitions. [2025-03-13 22:18:05,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 425 transitions, 1036 flow [2025-03-13 22:18:05,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 425 transitions, 1034 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:18:05,271 INFO L231 Difference]: Finished difference. Result has 428 places, 423 transitions, 870 flow [2025-03-13 22:18:05,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=870, PETRI_PLACES=428, PETRI_TRANSITIONS=423} [2025-03-13 22:18:05,276 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 1 predicate places. [2025-03-13 22:18:05,277 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 423 transitions, 870 flow [2025-03-13 22:18:05,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 0 states have call successors, (0), 0 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-13 22:18:05,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:05,278 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] [2025-03-13 22:18:05,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:18:05,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:05,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:05,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2013362433, now seen corresponding path program 1 times [2025-03-13 22:18:05,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:05,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543390464] [2025-03-13 22:18:05,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:05,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:05,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-13 22:18:05,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-13 22:18:05,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:05,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:05,782 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-13 22:18:05,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:05,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543390464] [2025-03-13 22:18:05,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543390464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:05,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:05,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:05,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030009327] [2025-03-13 22:18:05,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:05,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:05,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:05,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:05,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:06,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 433 [2025-03-13 22:18:06,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 423 transitions, 870 flow. Second operand has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 0 states have call successors, (0), 0 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-13 22:18:06,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:06,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 433 [2025-03-13 22:18:06,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:06,589 INFO L124 PetriNetUnfolderBase]: 450/1899 cut-off events. [2025-03-13 22:18:06,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:18:06,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2815 conditions, 1899 events. 450/1899 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11444 event pairs, 342 based on Foata normal form. 0/1691 useless extension candidates. Maximal degree in co-relation 2641. Up to 854 conditions per place. [2025-03-13 22:18:06,599 INFO L140 encePairwiseOnDemand]: 421/433 looper letters, 80 selfloop transitions, 10 changer transitions 0/421 dead transitions. [2025-03-13 22:18:06,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 421 transitions, 1046 flow [2025-03-13 22:18:06,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2114 transitions. [2025-03-13 22:18:06,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8137028483448807 [2025-03-13 22:18:06,603 INFO L175 Difference]: Start difference. First operand has 428 places, 423 transitions, 870 flow. Second operand 6 states and 2114 transitions. [2025-03-13 22:18:06,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 421 transitions, 1046 flow [2025-03-13 22:18:06,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 421 transitions, 1026 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:18:06,609 INFO L231 Difference]: Finished difference. Result has 424 places, 421 transitions, 866 flow [2025-03-13 22:18:06,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=866, PETRI_PLACES=424, PETRI_TRANSITIONS=421} [2025-03-13 22:18:06,610 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -3 predicate places. [2025-03-13 22:18:06,610 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 421 transitions, 866 flow [2025-03-13 22:18:06,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 0 states have call successors, (0), 0 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-13 22:18:06,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:06,611 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] [2025-03-13 22:18:06,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:18:06,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:06,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:06,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1494163021, now seen corresponding path program 1 times [2025-03-13 22:18:06,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:06,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049106675] [2025-03-13 22:18:06,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:06,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:06,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-13 22:18:06,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-13 22:18:06,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:06,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:06,714 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-13 22:18:06,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:06,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049106675] [2025-03-13 22:18:06,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049106675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:06,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:06,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:18:06,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823115236] [2025-03-13 22:18:06,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:06,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:18:06,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:06,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:18:06,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:18:06,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 433 [2025-03-13 22:18:06,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 421 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 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-13 22:18:06,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:06,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 433 [2025-03-13 22:18:06,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:06,812 INFO L124 PetriNetUnfolderBase]: 30/723 cut-off events. [2025-03-13 22:18:06,812 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:18:06,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 723 events. 30/723 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2593 event pairs, 18 based on Foata normal form. 1/669 useless extension candidates. Maximal degree in co-relation 493. Up to 45 conditions per place. [2025-03-13 22:18:06,817 INFO L140 encePairwiseOnDemand]: 430/433 looper letters, 11 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-03-13 22:18:06,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 422 transitions, 894 flow [2025-03-13 22:18:06,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:18:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:18:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1265 transitions. [2025-03-13 22:18:06,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9738260200153964 [2025-03-13 22:18:06,820 INFO L175 Difference]: Start difference. First operand has 424 places, 421 transitions, 866 flow. Second operand 3 states and 1265 transitions. [2025-03-13 22:18:06,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 422 transitions, 894 flow [2025-03-13 22:18:06,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 422 transitions, 874 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:18:06,829 INFO L231 Difference]: Finished difference. Result has 422 places, 422 transitions, 858 flow [2025-03-13 22:18:06,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=422, PETRI_TRANSITIONS=422} [2025-03-13 22:18:06,831 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -5 predicate places. [2025-03-13 22:18:06,831 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 422 transitions, 858 flow [2025-03-13 22:18:06,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 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-13 22:18:06,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:06,832 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-13 22:18:06,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:18:06,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:06,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:06,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1543026234, now seen corresponding path program 1 times [2025-03-13 22:18:06,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:06,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389578803] [2025-03-13 22:18:06,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:06,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:06,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-13 22:18:06,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-13 22:18:06,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:06,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:07,224 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-13 22:18:07,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:07,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389578803] [2025-03-13 22:18:07,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389578803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:07,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:07,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:07,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889247277] [2025-03-13 22:18:07,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:07,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:07,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:07,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:07,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:07,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 433 [2025-03-13 22:18:07,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 422 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 338.6666666666667) internal successors, (2032), 6 states have internal predecessors, (2032), 0 states have call successors, (0), 0 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-13 22:18:07,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:07,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 433 [2025-03-13 22:18:07,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:07,723 INFO L124 PetriNetUnfolderBase]: 451/2021 cut-off events. [2025-03-13 22:18:07,723 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:18:07,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 2021 events. 451/2021 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12129 event pairs, 342 based on Foata normal form. 0/1809 useless extension candidates. Maximal degree in co-relation 2721. Up to 902 conditions per place. [2025-03-13 22:18:07,732 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 87 selfloop transitions, 5 changer transitions 0/421 dead transitions. [2025-03-13 22:18:07,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 421 transitions, 1040 flow [2025-03-13 22:18:07,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2109 transitions. [2025-03-13 22:18:07,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8117782909930716 [2025-03-13 22:18:07,735 INFO L175 Difference]: Start difference. First operand has 422 places, 422 transitions, 858 flow. Second operand 6 states and 2109 transitions. [2025-03-13 22:18:07,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 421 transitions, 1040 flow [2025-03-13 22:18:07,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 421 transitions, 1038 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:18:07,740 INFO L231 Difference]: Finished difference. Result has 425 places, 421 transitions, 864 flow [2025-03-13 22:18:07,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=425, PETRI_TRANSITIONS=421} [2025-03-13 22:18:07,741 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -2 predicate places. [2025-03-13 22:18:07,741 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 421 transitions, 864 flow [2025-03-13 22:18:07,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.6666666666667) internal successors, (2032), 6 states have internal predecessors, (2032), 0 states have call successors, (0), 0 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-13 22:18:07,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:07,743 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] [2025-03-13 22:18:07,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:18:07,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:07,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:07,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2082666602, now seen corresponding path program 1 times [2025-03-13 22:18:07,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:07,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545362228] [2025-03-13 22:18:07,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:07,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:07,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-13 22:18:07,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-13 22:18:07,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:07,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:07,798 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-13 22:18:07,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:07,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545362228] [2025-03-13 22:18:07,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545362228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:07,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:07,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:18:07,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475116956] [2025-03-13 22:18:07,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:07,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:18:07,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:07,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:18:07,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:18:07,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 433 [2025-03-13 22:18:07,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 421 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 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-13 22:18:07,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:07,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 433 [2025-03-13 22:18:07,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:07,898 INFO L124 PetriNetUnfolderBase]: 30/909 cut-off events. [2025-03-13 22:18:07,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:18:07,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 909 events. 30/909 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2595 event pairs, 18 based on Foata normal form. 2/850 useless extension candidates. Maximal degree in co-relation 571. Up to 49 conditions per place. [2025-03-13 22:18:07,904 INFO L140 encePairwiseOnDemand]: 430/433 looper letters, 11 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-03-13 22:18:07,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 422 transitions, 892 flow [2025-03-13 22:18:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:18:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:18:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1265 transitions. [2025-03-13 22:18:07,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9738260200153964 [2025-03-13 22:18:07,907 INFO L175 Difference]: Start difference. First operand has 425 places, 421 transitions, 864 flow. Second operand 3 states and 1265 transitions. [2025-03-13 22:18:07,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 422 transitions, 892 flow [2025-03-13 22:18:07,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 422 transitions, 882 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:18:07,912 INFO L231 Difference]: Finished difference. Result has 423 places, 422 transitions, 866 flow [2025-03-13 22:18:07,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=423, PETRI_TRANSITIONS=422} [2025-03-13 22:18:07,913 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -4 predicate places. [2025-03-13 22:18:07,913 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 422 transitions, 866 flow [2025-03-13 22:18:07,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 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-13 22:18:07,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:07,914 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:18:07,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:18:07,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:07,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:07,915 INFO L85 PathProgramCache]: Analyzing trace with hash 430399053, now seen corresponding path program 1 times [2025-03-13 22:18:07,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:07,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998109696] [2025-03-13 22:18:07,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:07,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:07,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-13 22:18:07,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:18:07,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:07,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:08,416 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-13 22:18:08,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:08,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998109696] [2025-03-13 22:18:08,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998109696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:08,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:08,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97338912] [2025-03-13 22:18:08,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:08,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:08,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:08,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:08,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 433 [2025-03-13 22:18:08,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 422 transitions, 866 flow. Second operand has 6 states, 6 states have (on average 373.5) internal successors, (2241), 6 states have internal predecessors, (2241), 0 states have call successors, (0), 0 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-13 22:18:08,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:08,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 433 [2025-03-13 22:18:08,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:08,949 INFO L124 PetriNetUnfolderBase]: 76/1221 cut-off events. [2025-03-13 22:18:08,950 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:18:08,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 1221 events. 76/1221 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4722 event pairs, 42 based on Foata normal form. 0/1125 useless extension candidates. Maximal degree in co-relation 1011. Up to 263 conditions per place. [2025-03-13 22:18:08,954 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 54 selfloop transitions, 5 changer transitions 0/421 dead transitions. [2025-03-13 22:18:08,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 421 transitions, 982 flow [2025-03-13 22:18:08,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2274 transitions. [2025-03-13 22:18:08,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8752886836027713 [2025-03-13 22:18:08,957 INFO L175 Difference]: Start difference. First operand has 423 places, 422 transitions, 866 flow. Second operand 6 states and 2274 transitions. [2025-03-13 22:18:08,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 421 transitions, 982 flow [2025-03-13 22:18:08,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 421 transitions, 980 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:18:08,962 INFO L231 Difference]: Finished difference. Result has 426 places, 421 transitions, 872 flow [2025-03-13 22:18:08,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=872, PETRI_PLACES=426, PETRI_TRANSITIONS=421} [2025-03-13 22:18:08,965 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -1 predicate places. [2025-03-13 22:18:08,966 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 421 transitions, 872 flow [2025-03-13 22:18:08,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 373.5) internal successors, (2241), 6 states have internal predecessors, (2241), 0 states have call successors, (0), 0 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-13 22:18:08,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:08,967 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] [2025-03-13 22:18:08,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:18:08,967 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:08,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:08,968 INFO L85 PathProgramCache]: Analyzing trace with hash 6833578, now seen corresponding path program 1 times [2025-03-13 22:18:08,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:08,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662451768] [2025-03-13 22:18:08,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:08,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:08,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-13 22:18:08,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-13 22:18:08,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:08,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:09,337 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-13 22:18:09,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:09,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662451768] [2025-03-13 22:18:09,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662451768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:09,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:09,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:09,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042083028] [2025-03-13 22:18:09,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:09,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:09,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:09,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:09,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:09,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 433 [2025-03-13 22:18:09,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 421 transitions, 872 flow. Second operand has 6 states, 6 states have (on average 341.3333333333333) internal successors, (2048), 6 states have internal predecessors, (2048), 0 states have call successors, (0), 0 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-13 22:18:09,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:09,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 433 [2025-03-13 22:18:09,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:09,938 INFO L124 PetriNetUnfolderBase]: 451/2201 cut-off events. [2025-03-13 22:18:09,938 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:18:09,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3265 conditions, 2201 events. 451/2201 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12278 event pairs, 342 based on Foata normal form. 0/1989 useless extension candidates. Maximal degree in co-relation 2764. Up to 968 conditions per place. [2025-03-13 22:18:09,953 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 87 selfloop transitions, 5 changer transitions 0/420 dead transitions. [2025-03-13 22:18:09,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 420 transitions, 1054 flow [2025-03-13 22:18:09,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2109 transitions. [2025-03-13 22:18:09,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8117782909930716 [2025-03-13 22:18:09,959 INFO L175 Difference]: Start difference. First operand has 426 places, 421 transitions, 872 flow. Second operand 6 states and 2109 transitions. [2025-03-13 22:18:09,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 420 transitions, 1054 flow [2025-03-13 22:18:09,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 420 transitions, 1044 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:18:09,967 INFO L231 Difference]: Finished difference. Result has 425 places, 420 transitions, 870 flow [2025-03-13 22:18:09,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=870, PETRI_PLACES=425, PETRI_TRANSITIONS=420} [2025-03-13 22:18:09,970 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -2 predicate places. [2025-03-13 22:18:09,970 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 420 transitions, 870 flow [2025-03-13 22:18:09,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 341.3333333333333) internal successors, (2048), 6 states have internal predecessors, (2048), 0 states have call successors, (0), 0 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-13 22:18:09,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:09,972 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] [2025-03-13 22:18:09,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:18:09,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:09,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:09,974 INFO L85 PathProgramCache]: Analyzing trace with hash 650457920, now seen corresponding path program 1 times [2025-03-13 22:18:09,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:09,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307917088] [2025-03-13 22:18:09,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:09,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:10,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-13 22:18:10,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-13 22:18:10,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:10,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:10,373 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-13 22:18:10,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307917088] [2025-03-13 22:18:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307917088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:10,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:10,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:10,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217198577] [2025-03-13 22:18:10,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:10,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:10,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:10,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:10,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:10,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 433 [2025-03-13 22:18:10,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 420 transitions, 870 flow. Second operand has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-13 22:18:10,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:10,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 433 [2025-03-13 22:18:10,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:10,995 INFO L124 PetriNetUnfolderBase]: 451/2197 cut-off events. [2025-03-13 22:18:10,995 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:18:10,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3245 conditions, 2197 events. 451/2197 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12298 event pairs, 342 based on Foata normal form. 0/1989 useless extension candidates. Maximal degree in co-relation 2780. Up to 952 conditions per place. [2025-03-13 22:18:11,006 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 83 selfloop transitions, 5 changer transitions 0/419 dead transitions. [2025-03-13 22:18:11,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 419 transitions, 1044 flow [2025-03-13 22:18:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2129 transitions. [2025-03-13 22:18:11,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8194765204003079 [2025-03-13 22:18:11,010 INFO L175 Difference]: Start difference. First operand has 425 places, 420 transitions, 870 flow. Second operand 6 states and 2129 transitions. [2025-03-13 22:18:11,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 419 transitions, 1044 flow [2025-03-13 22:18:11,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 419 transitions, 1034 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:18:11,014 INFO L231 Difference]: Finished difference. Result has 424 places, 419 transitions, 868 flow [2025-03-13 22:18:11,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=868, PETRI_PLACES=424, PETRI_TRANSITIONS=419} [2025-03-13 22:18:11,015 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -3 predicate places. [2025-03-13 22:18:11,015 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 419 transitions, 868 flow [2025-03-13 22:18:11,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-13 22:18:11,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:11,017 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-13 22:18:11,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:18:11,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:11,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:11,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2106319920, now seen corresponding path program 1 times [2025-03-13 22:18:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:11,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001583621] [2025-03-13 22:18:11,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:11,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:11,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-13 22:18:11,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-13 22:18:11,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:11,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:11,351 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-13 22:18:11,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:11,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001583621] [2025-03-13 22:18:11,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001583621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:11,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:11,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:11,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411920921] [2025-03-13 22:18:11,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:11,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:11,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:11,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:11,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:11,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 433 [2025-03-13 22:18:11,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 419 transitions, 868 flow. Second operand has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-13 22:18:11,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:11,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 433 [2025-03-13 22:18:11,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:11,841 INFO L124 PetriNetUnfolderBase]: 451/2193 cut-off events. [2025-03-13 22:18:11,841 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:18:11,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3241 conditions, 2193 events. 451/2193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12230 event pairs, 342 based on Foata normal form. 0/1989 useless extension candidates. Maximal degree in co-relation 2795. Up to 952 conditions per place. [2025-03-13 22:18:11,850 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 83 selfloop transitions, 5 changer transitions 0/418 dead transitions. [2025-03-13 22:18:11,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 418 transitions, 1042 flow [2025-03-13 22:18:11,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2129 transitions. [2025-03-13 22:18:11,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8194765204003079 [2025-03-13 22:18:11,856 INFO L175 Difference]: Start difference. First operand has 424 places, 419 transitions, 868 flow. Second operand 6 states and 2129 transitions. [2025-03-13 22:18:11,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 418 transitions, 1042 flow [2025-03-13 22:18:11,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 418 transitions, 1032 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:18:11,861 INFO L231 Difference]: Finished difference. Result has 423 places, 418 transitions, 866 flow [2025-03-13 22:18:11,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=866, PETRI_PLACES=423, PETRI_TRANSITIONS=418} [2025-03-13 22:18:11,862 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -4 predicate places. [2025-03-13 22:18:11,862 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 418 transitions, 866 flow [2025-03-13 22:18:11,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-13 22:18:11,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:11,864 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-13 22:18:11,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:18:11,864 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:11,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1626202654, now seen corresponding path program 1 times [2025-03-13 22:18:11,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:11,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130322119] [2025-03-13 22:18:11,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:11,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:11,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-13 22:18:11,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-13 22:18:11,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:11,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:18:12,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:12,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130322119] [2025-03-13 22:18:12,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130322119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:12,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:12,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:12,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044222181] [2025-03-13 22:18:12,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:12,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:12,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:12,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:12,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:12,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 433 [2025-03-13 22:18:12,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 418 transitions, 866 flow. Second operand has 6 states, 6 states have (on average 342.5) internal successors, (2055), 6 states have internal predecessors, (2055), 0 states have call successors, (0), 0 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-13 22:18:12,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:12,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 433 [2025-03-13 22:18:12,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:12,872 INFO L124 PetriNetUnfolderBase]: 451/2189 cut-off events. [2025-03-13 22:18:12,873 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:18:12,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 2189 events. 451/2189 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12252 event pairs, 342 based on Foata normal form. 0/1989 useless extension candidates. Maximal degree in co-relation 2808. Up to 972 conditions per place. [2025-03-13 22:18:12,879 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 88 selfloop transitions, 5 changer transitions 0/417 dead transitions. [2025-03-13 22:18:12,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 417 transitions, 1050 flow [2025-03-13 22:18:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2104 transitions. [2025-03-13 22:18:12,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8098537336412626 [2025-03-13 22:18:12,884 INFO L175 Difference]: Start difference. First operand has 423 places, 418 transitions, 866 flow. Second operand 6 states and 2104 transitions. [2025-03-13 22:18:12,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 417 transitions, 1050 flow [2025-03-13 22:18:12,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 417 transitions, 1040 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:18:12,889 INFO L231 Difference]: Finished difference. Result has 422 places, 417 transitions, 864 flow [2025-03-13 22:18:12,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=422, PETRI_TRANSITIONS=417} [2025-03-13 22:18:12,891 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -5 predicate places. [2025-03-13 22:18:12,891 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 417 transitions, 864 flow [2025-03-13 22:18:12,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 342.5) internal successors, (2055), 6 states have internal predecessors, (2055), 0 states have call successors, (0), 0 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-13 22:18:12,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:12,893 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] [2025-03-13 22:18:12,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:18:12,893 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:12,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1341796710, now seen corresponding path program 1 times [2025-03-13 22:18:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:12,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519868294] [2025-03-13 22:18:12,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:12,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:12,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-13 22:18:12,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-13 22:18:12,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:12,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:18:13,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:13,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519868294] [2025-03-13 22:18:13,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519868294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:18:13,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82033528] [2025-03-13 22:18:13,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:13,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:18:13,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:18:13,043 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-13 22:18:13,045 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-13 22:18:13,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-13 22:18:13,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-13 22:18:13,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:13,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:13,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 22:18:13,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:18:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:18:13,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:18:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:18:13,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82033528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:18:13,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:18:13,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 22:18:13,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014305023] [2025-03-13 22:18:13,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:18:13,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:18:13,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:13,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:18:13,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:18:13,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 433 [2025-03-13 22:18:13,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 417 transitions, 864 flow. Second operand has 10 states, 10 states have (on average 415.8) internal successors, (4158), 10 states have internal predecessors, (4158), 0 states have call successors, (0), 0 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-13 22:18:13,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:13,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 433 [2025-03-13 22:18:13,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:13,647 INFO L124 PetriNetUnfolderBase]: 30/1073 cut-off events. [2025-03-13 22:18:13,647 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:18:13,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 1073 events. 30/1073 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2007 event pairs, 18 based on Foata normal form. 4/1036 useless extension candidates. Maximal degree in co-relation 564. Up to 49 conditions per place. [2025-03-13 22:18:13,651 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 15 selfloop transitions, 9 changer transitions 0/425 dead transitions. [2025-03-13 22:18:13,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 425 transitions, 930 flow [2025-03-13 22:18:13,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:18:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:18:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3752 transitions. [2025-03-13 22:18:13,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627918911983577 [2025-03-13 22:18:13,656 INFO L175 Difference]: Start difference. First operand has 422 places, 417 transitions, 864 flow. Second operand 9 states and 3752 transitions. [2025-03-13 22:18:13,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 425 transitions, 930 flow [2025-03-13 22:18:13,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 425 transitions, 920 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:18:13,660 INFO L231 Difference]: Finished difference. Result has 428 places, 423 transitions, 904 flow [2025-03-13 22:18:13,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=904, PETRI_PLACES=428, PETRI_TRANSITIONS=423} [2025-03-13 22:18:13,661 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 1 predicate places. [2025-03-13 22:18:13,661 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 423 transitions, 904 flow [2025-03-13 22:18:13,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 415.8) internal successors, (4158), 10 states have internal predecessors, (4158), 0 states have call successors, (0), 0 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-13 22:18:13,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:13,663 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] [2025-03-13 22:18:13,670 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-13 22:18:13,863 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-13 22:18:13,863 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:13,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1443910352, now seen corresponding path program 2 times [2025-03-13 22:18:13,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:13,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169553492] [2025-03-13 22:18:13,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:18:13,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:13,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 407 statements into 2 equivalence classes. [2025-03-13 22:18:13,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 108 of 407 statements. [2025-03-13 22:18:13,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:18:13,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-13 22:18:14,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:14,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169553492] [2025-03-13 22:18:14,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169553492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:14,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:14,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:14,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643657423] [2025-03-13 22:18:14,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:14,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:14,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:14,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:14,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:14,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 433 [2025-03-13 22:18:14,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 423 transitions, 904 flow. Second operand has 6 states, 6 states have (on average 376.3333333333333) internal successors, (2258), 6 states have internal predecessors, (2258), 0 states have call successors, (0), 0 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-13 22:18:14,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:14,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 433 [2025-03-13 22:18:14,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:15,140 INFO L124 PetriNetUnfolderBase]: 76/1388 cut-off events. [2025-03-13 22:18:15,140 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-13 22:18:15,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 1388 events. 76/1388 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4072 event pairs, 42 based on Foata normal form. 0/1305 useless extension candidates. Maximal degree in co-relation 1133. Up to 307 conditions per place. [2025-03-13 22:18:15,145 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 54 selfloop transitions, 5 changer transitions 0/422 dead transitions. [2025-03-13 22:18:15,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 422 transitions, 1020 flow [2025-03-13 22:18:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2274 transitions. [2025-03-13 22:18:15,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8752886836027713 [2025-03-13 22:18:15,149 INFO L175 Difference]: Start difference. First operand has 428 places, 423 transitions, 904 flow. Second operand 6 states and 2274 transitions. [2025-03-13 22:18:15,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 422 transitions, 1020 flow [2025-03-13 22:18:15,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 422 transitions, 1014 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 22:18:15,180 INFO L231 Difference]: Finished difference. Result has 431 places, 422 transitions, 906 flow [2025-03-13 22:18:15,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=906, PETRI_PLACES=431, PETRI_TRANSITIONS=422} [2025-03-13 22:18:15,182 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 4 predicate places. [2025-03-13 22:18:15,182 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 422 transitions, 906 flow [2025-03-13 22:18:15,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 376.3333333333333) internal successors, (2258), 6 states have internal predecessors, (2258), 0 states have call successors, (0), 0 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-13 22:18:15,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:15,183 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] [2025-03-13 22:18:15,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:18:15,184 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:15,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:15,185 INFO L85 PathProgramCache]: Analyzing trace with hash 691802021, now seen corresponding path program 1 times [2025-03-13 22:18:15,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:15,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547707811] [2025-03-13 22:18:15,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:15,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:15,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-13 22:18:15,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-13 22:18:15,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:15,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-03-13 22:18:15,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:15,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547707811] [2025-03-13 22:18:15,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547707811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:18:15,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116536604] [2025-03-13 22:18:15,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:15,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:18:15,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:18:15,448 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-13 22:18:15,450 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-13 22:18:15,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-13 22:18:15,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-13 22:18:15,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:15,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:15,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 22:18:15,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:18:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 333 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-13 22:18:16,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:18:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 333 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-13 22:18:16,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116536604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:18:16,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:18:16,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-13 22:18:16,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500322088] [2025-03-13 22:18:16,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:18:16,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-13 22:18:16,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:16,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-13 22:18:16,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-13 22:18:16,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 433 [2025-03-13 22:18:16,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 422 transitions, 906 flow. Second operand has 19 states, 19 states have (on average 410.5263157894737) internal successors, (7800), 19 states have internal predecessors, (7800), 0 states have call successors, (0), 0 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-13 22:18:16,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:16,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 433 [2025-03-13 22:18:16,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:17,546 INFO L124 PetriNetUnfolderBase]: 31/2452 cut-off events. [2025-03-13 22:18:17,547 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-13 22:18:17,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 2452 events. 31/2452 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1990 event pairs, 18 based on Foata normal form. 13/2425 useless extension candidates. Maximal degree in co-relation 2363. Up to 51 conditions per place. [2025-03-13 22:18:17,550 INFO L140 encePairwiseOnDemand]: 422/433 looper letters, 47 selfloop transitions, 68 changer transitions 0/508 dead transitions. [2025-03-13 22:18:17,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 508 transitions, 1546 flow [2025-03-13 22:18:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-13 22:18:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-13 22:18:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 25832 transitions. [2025-03-13 22:18:17,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9469555335606143 [2025-03-13 22:18:17,575 INFO L175 Difference]: Start difference. First operand has 431 places, 422 transitions, 906 flow. Second operand 63 states and 25832 transitions. [2025-03-13 22:18:17,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 508 transitions, 1546 flow [2025-03-13 22:18:17,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 508 transitions, 1536 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:18:17,583 INFO L231 Difference]: Finished difference. Result has 504 places, 484 transitions, 1416 flow [2025-03-13 22:18:17,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1416, PETRI_PLACES=504, PETRI_TRANSITIONS=484} [2025-03-13 22:18:17,584 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 77 predicate places. [2025-03-13 22:18:17,584 INFO L471 AbstractCegarLoop]: Abstraction has has 504 places, 484 transitions, 1416 flow [2025-03-13 22:18:17,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 410.5263157894737) internal successors, (7800), 19 states have internal predecessors, (7800), 0 states have call successors, (0), 0 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-13 22:18:17,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:17,587 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] [2025-03-13 22:18:17,597 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-13 22:18:17,788 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-13 22:18:17,788 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:17,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:17,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1066514419, now seen corresponding path program 2 times [2025-03-13 22:18:17,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:17,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85181987] [2025-03-13 22:18:17,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:18:17,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:17,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1426 statements into 2 equivalence classes. [2025-03-13 22:18:17,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 108 of 1426 statements. [2025-03-13 22:18:17,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:18:17,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10209 trivial. 0 not checked. [2025-03-13 22:18:18,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:18,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85181987] [2025-03-13 22:18:18,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85181987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:18,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:18,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:18,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873331583] [2025-03-13 22:18:18,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:18,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:18,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:18,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:18,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:18,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 433 [2025-03-13 22:18:18,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 484 transitions, 1416 flow. Second operand has 6 states, 6 states have (on average 376.3333333333333) internal successors, (2258), 6 states have internal predecessors, (2258), 0 states have call successors, (0), 0 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-13 22:18:18,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:18,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 433 [2025-03-13 22:18:18,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:19,574 INFO L124 PetriNetUnfolderBase]: 77/2767 cut-off events. [2025-03-13 22:18:19,574 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-03-13 22:18:19,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3861 conditions, 2767 events. 77/2767 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4061 event pairs, 42 based on Foata normal form. 0/2685 useless extension candidates. Maximal degree in co-relation 1813. Up to 735 conditions per place. [2025-03-13 22:18:19,579 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 54 selfloop transitions, 5 changer transitions 0/483 dead transitions. [2025-03-13 22:18:19,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 483 transitions, 1532 flow [2025-03-13 22:18:19,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2274 transitions. [2025-03-13 22:18:19,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8752886836027713 [2025-03-13 22:18:19,581 INFO L175 Difference]: Start difference. First operand has 504 places, 484 transitions, 1416 flow. Second operand 6 states and 2274 transitions. [2025-03-13 22:18:19,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 483 transitions, 1532 flow [2025-03-13 22:18:19,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 483 transitions, 1456 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-13 22:18:19,588 INFO L231 Difference]: Finished difference. Result has 501 places, 483 transitions, 1348 flow [2025-03-13 22:18:19,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1348, PETRI_PLACES=501, PETRI_TRANSITIONS=483} [2025-03-13 22:18:19,589 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 74 predicate places. [2025-03-13 22:18:19,589 INFO L471 AbstractCegarLoop]: Abstraction has has 501 places, 483 transitions, 1348 flow [2025-03-13 22:18:19,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 376.3333333333333) internal successors, (2258), 6 states have internal predecessors, (2258), 0 states have call successors, (0), 0 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-13 22:18:19,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:19,591 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] [2025-03-13 22:18:19,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:18:19,591 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:19,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:19,594 INFO L85 PathProgramCache]: Analyzing trace with hash 303644116, now seen corresponding path program 1 times [2025-03-13 22:18:19,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:19,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516011257] [2025-03-13 22:18:19,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:19,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:19,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1460 statements into 1 equivalence classes. [2025-03-13 22:18:19,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1460 of 1460 statements. [2025-03-13 22:18:19,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:19,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10279 backedges. 5465 proven. 2317 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2025-03-13 22:18:21,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:21,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516011257] [2025-03-13 22:18:21,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516011257] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:18:21,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130371440] [2025-03-13 22:18:21,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:21,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:18:21,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:18:21,952 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-13 22:18:21,958 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-13 22:18:22,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1460 statements into 1 equivalence classes. [2025-03-13 22:18:22,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1460 of 1460 statements. [2025-03-13 22:18:22,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:22,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:22,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 5698 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 22:18:22,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:18:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10279 backedges. 5465 proven. 2317 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2025-03-13 22:18:23,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:18:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10279 backedges. 5465 proven. 2317 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2025-03-13 22:18:24,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130371440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:18:24,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:18:24,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-13 22:18:24,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158836633] [2025-03-13 22:18:24,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:18:24,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 22:18:24,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:24,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 22:18:24,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 22:18:24,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 433 [2025-03-13 22:18:24,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 483 transitions, 1348 flow. Second operand has 34 states, 34 states have (on average 416.1764705882353) internal successors, (14150), 34 states have internal predecessors, (14150), 0 states have call successors, (0), 0 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-13 22:18:24,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:24,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 433 [2025-03-13 22:18:24,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:25,936 INFO L124 PetriNetUnfolderBase]: 31/4611 cut-off events. [2025-03-13 22:18:25,936 INFO L125 PetriNetUnfolderBase]: For 3207/3207 co-relation queries the response was YES. [2025-03-13 22:18:25,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5422 conditions, 4611 events. 31/4611 cut-off events. For 3207/3207 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1988 event pairs, 18 based on Foata normal form. 24/4596 useless extension candidates. Maximal degree in co-relation 5381. Up to 78 conditions per place. [2025-03-13 22:18:25,942 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 47 selfloop transitions, 135 changer transitions 0/584 dead transitions. [2025-03-13 22:18:25,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 584 transitions, 2476 flow [2025-03-13 22:18:25,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-13 22:18:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-13 22:18:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 18710 transitions. [2025-03-13 22:18:25,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9602258147292789 [2025-03-13 22:18:25,949 INFO L175 Difference]: Start difference. First operand has 501 places, 483 transitions, 1348 flow. Second operand 45 states and 18710 transitions. [2025-03-13 22:18:25,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 584 transitions, 2476 flow [2025-03-13 22:18:25,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 584 transitions, 2466 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:18:25,960 INFO L231 Difference]: Finished difference. Result has 549 places, 558 transitions, 2212 flow [2025-03-13 22:18:25,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2212, PETRI_PLACES=549, PETRI_TRANSITIONS=558} [2025-03-13 22:18:25,961 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 122 predicate places. [2025-03-13 22:18:25,961 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 558 transitions, 2212 flow [2025-03-13 22:18:25,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 416.1764705882353) internal successors, (14150), 34 states have internal predecessors, (14150), 0 states have call successors, (0), 0 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-13 22:18:25,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:25,964 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] [2025-03-13 22:18:25,980 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-13 22:18:26,164 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-13 22:18:26,165 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:26,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:26,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1192048428, now seen corresponding path program 2 times [2025-03-13 22:18:26,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:26,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907683892] [2025-03-13 22:18:26,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:18:26,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:26,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2900 statements into 2 equivalence classes. [2025-03-13 22:18:26,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 142 of 2900 statements. [2025-03-13 22:18:26,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:18:26,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 48391 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48391 trivial. 0 not checked. [2025-03-13 22:18:26,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:26,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907683892] [2025-03-13 22:18:26,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907683892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:26,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:26,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:26,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979493005] [2025-03-13 22:18:26,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:26,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:26,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:26,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:26,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:27,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 433 [2025-03-13 22:18:27,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 558 transitions, 2212 flow. Second operand has 6 states, 6 states have (on average 377.5) internal successors, (2265), 6 states have internal predecessors, (2265), 0 states have call successors, (0), 0 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-13 22:18:27,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:27,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 433 [2025-03-13 22:18:27,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:29,902 INFO L124 PetriNetUnfolderBase]: 201/5512 cut-off events. [2025-03-13 22:18:29,902 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-03-13 22:18:29,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7962 conditions, 5512 events. 201/5512 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8977 event pairs, 54 based on Foata normal form. 0/5369 useless extension candidates. Maximal degree in co-relation 4118. Up to 1548 conditions per place. [2025-03-13 22:18:29,915 INFO L140 encePairwiseOnDemand]: 421/433 looper letters, 71 selfloop transitions, 23 changer transitions 0/593 dead transitions. [2025-03-13 22:18:29,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 593 transitions, 2478 flow [2025-03-13 22:18:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:29,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2315 transitions. [2025-03-13 22:18:29,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8910700538876059 [2025-03-13 22:18:29,922 INFO L175 Difference]: Start difference. First operand has 549 places, 558 transitions, 2212 flow. Second operand 6 states and 2315 transitions. [2025-03-13 22:18:29,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 593 transitions, 2478 flow [2025-03-13 22:18:29,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 593 transitions, 2370 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-13 22:18:29,945 INFO L231 Difference]: Finished difference. Result has 541 places, 580 transitions, 2262 flow [2025-03-13 22:18:29,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2262, PETRI_PLACES=541, PETRI_TRANSITIONS=580} [2025-03-13 22:18:29,947 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 114 predicate places. [2025-03-13 22:18:29,947 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 580 transitions, 2262 flow [2025-03-13 22:18:29,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 377.5) internal successors, (2265), 6 states have internal predecessors, (2265), 0 states have call successors, (0), 0 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-13 22:18:29,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:29,949 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] [2025-03-13 22:18:29,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:18:29,949 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:29,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1451090776, now seen corresponding path program 1 times [2025-03-13 22:18:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:29,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940314279] [2025-03-13 22:18:29,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:29,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:30,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2906 statements into 1 equivalence classes. [2025-03-13 22:18:30,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2906 of 2906 statements. [2025-03-13 22:18:30,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:30,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 48391 backedges. 24881 proven. 11565 refuted. 0 times theorem prover too weak. 11945 trivial. 0 not checked. [2025-03-13 22:18:39,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:39,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940314279] [2025-03-13 22:18:39,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940314279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:18:39,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491074710] [2025-03-13 22:18:39,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:39,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:18:39,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:18:39,298 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-13 22:18:39,299 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-13 22:18:40,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2906 statements into 1 equivalence classes. [2025-03-13 22:18:41,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2906 of 2906 statements. [2025-03-13 22:18:41,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:41,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:41,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 11604 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-13 22:18:41,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:18:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 48391 backedges. 24881 proven. 11565 refuted. 0 times theorem prover too weak. 11945 trivial. 0 not checked. [2025-03-13 22:18:42,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:18:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 48391 backedges. 24881 proven. 11565 refuted. 0 times theorem prover too weak. 11945 trivial. 0 not checked. [2025-03-13 22:18:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491074710] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:18:43,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:18:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-13 22:18:43,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911669722] [2025-03-13 22:18:43,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:18:43,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-13 22:18:43,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:43,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-13 22:18:43,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-13 22:18:43,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 433 [2025-03-13 22:18:43,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 580 transitions, 2262 flow. Second operand has 63 states, 63 states have (on average 416.14285714285717) internal successors, (26217), 63 states have internal predecessors, (26217), 0 states have call successors, (0), 0 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-13 22:18:43,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:43,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 433 [2025-03-13 22:18:43,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:51,641 INFO L124 PetriNetUnfolderBase]: 187/9720 cut-off events. [2025-03-13 22:18:51,641 INFO L125 PetriNetUnfolderBase]: For 13429/13433 co-relation queries the response was YES. [2025-03-13 22:18:51,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12063 conditions, 9720 events. 187/9720 cut-off events. For 13429/13433 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9691 event pairs, 55 based on Foata normal form. 45/9595 useless extension candidates. Maximal degree in co-relation 10722. Up to 168 conditions per place. [2025-03-13 22:18:51,657 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 92 selfloop transitions, 270 changer transitions 0/786 dead transitions. [2025-03-13 22:18:51,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 786 transitions, 5172 flow [2025-03-13 22:18:51,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-13 22:18:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-13 22:18:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 37407 transitions. [2025-03-13 22:18:51,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9598922247882987 [2025-03-13 22:18:51,671 INFO L175 Difference]: Start difference. First operand has 541 places, 580 transitions, 2262 flow. Second operand 90 states and 37407 transitions. [2025-03-13 22:18:51,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 786 transitions, 5172 flow [2025-03-13 22:18:51,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 786 transitions, 5172 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:18:51,694 INFO L231 Difference]: Finished difference. Result has 646 places, 718 transitions, 4254 flow [2025-03-13 22:18:51,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=2262, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4254, PETRI_PLACES=646, PETRI_TRANSITIONS=718} [2025-03-13 22:18:51,695 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 219 predicate places. [2025-03-13 22:18:51,695 INFO L471 AbstractCegarLoop]: Abstraction has has 646 places, 718 transitions, 4254 flow [2025-03-13 22:18:51,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 416.14285714285717) internal successors, (26217), 63 states have internal predecessors, (26217), 0 states have call successors, (0), 0 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-13 22:18:51,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:51,702 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] [2025-03-13 22:18:51,734 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-13 22:18:51,902 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,SelfDestructingSolverStorable16 [2025-03-13 22:18:51,903 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:51,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2137761336, now seen corresponding path program 2 times [2025-03-13 22:18:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:51,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284309595] [2025-03-13 22:18:51,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:18:51,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:52,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5606 statements into 2 equivalence classes. [2025-03-13 22:18:52,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 148 of 5606 statements. [2025-03-13 22:18:52,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:18:52,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 195751 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195751 trivial. 0 not checked. [2025-03-13 22:18:52,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:52,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284309595] [2025-03-13 22:18:52,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284309595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:52,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:52,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:52,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593604972] [2025-03-13 22:18:52,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:52,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:52,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:52,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:52,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:53,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 433 [2025-03-13 22:18:53,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 718 transitions, 4254 flow. Second operand has 6 states, 6 states have (on average 377.6666666666667) internal successors, (2266), 6 states have internal predecessors, (2266), 0 states have call successors, (0), 0 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-13 22:18:53,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:53,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 433 [2025-03-13 22:18:53,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:02,486 INFO L124 PetriNetUnfolderBase]: 312/10276 cut-off events. [2025-03-13 22:19:02,486 INFO L125 PetriNetUnfolderBase]: For 3812/3845 co-relation queries the response was YES. [2025-03-13 22:19:02,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15664 conditions, 10276 events. 312/10276 cut-off events. For 3812/3845 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15805 event pairs, 61 based on Foata normal form. 8/10069 useless extension candidates. Maximal degree in co-relation 13453. Up to 2941 conditions per place. [2025-03-13 22:19:02,511 INFO L140 encePairwiseOnDemand]: 421/433 looper letters, 84 selfloop transitions, 31 changer transitions 0/757 dead transitions. [2025-03-13 22:19:02,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 757 transitions, 4604 flow [2025-03-13 22:19:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:19:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:19:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2311 transitions. [2025-03-13 22:19:02,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8895304080061586 [2025-03-13 22:19:02,513 INFO L175 Difference]: Start difference. First operand has 646 places, 718 transitions, 4254 flow. Second operand 6 states and 2311 transitions. [2025-03-13 22:19:02,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 757 transitions, 4604 flow [2025-03-13 22:19:02,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 757 transitions, 4250 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-13 22:19:02,552 INFO L231 Difference]: Finished difference. Result has 614 places, 748 transitions, 4158 flow [2025-03-13 22:19:02,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=3900, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4158, PETRI_PLACES=614, PETRI_TRANSITIONS=748} [2025-03-13 22:19:02,553 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 187 predicate places. [2025-03-13 22:19:02,553 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 748 transitions, 4158 flow [2025-03-13 22:19:02,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 377.6666666666667) internal successors, (2266), 6 states have internal predecessors, (2266), 0 states have call successors, (0), 0 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-13 22:19:02,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:02,554 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] [2025-03-13 22:19:02,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:19:02,555 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:19:02,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash -372556868, now seen corresponding path program 1 times [2025-03-13 22:19:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:02,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308075651] [2025-03-13 22:19:02,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:03,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5610 statements into 1 equivalence classes. [2025-03-13 22:19:04,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5610 of 5610 statements. [2025-03-13 22:19:04,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:04,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 195751 backedges. 300 proven. 99091 refuted. 0 times theorem prover too weak. 96360 trivial. 0 not checked. [2025-03-13 22:19:16,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:16,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308075651] [2025-03-13 22:19:16,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308075651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:19:16,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784137980] [2025-03-13 22:19:16,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:16,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:19:16,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:19:16,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:19:16,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 22:19:18,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5610 statements into 1 equivalence classes.