./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/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-?-798a7b3-m [2025-03-04 06:47:39,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:47:39,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:47:39,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:47:39,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:47:39,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:47:39,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:47:39,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:47:39,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:47:39,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:47:39,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:47:39,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:47:39,913 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:47:39,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:47:39,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:47:39,913 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:47:39,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:47:39,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:47:39,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:47:39,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:47:39,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:47:39,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:47:39,915 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:47:39,915 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:47:39,915 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:47:39,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:47:39,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:47:39,915 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:47:39,915 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:47:39,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:47:39,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:47:39,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:47:39,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:47:39,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:47:39,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:47:39,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:47:39,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:47:39,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:47:39,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:47:39,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:47:39,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:47:39,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:47:39,916 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-04 06:47:40,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:47:40,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:47:40,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:47:40,152 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:47:40,152 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:47:40,153 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-04 06:47:41,302 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ff38654/84a9f18722f9478abd493d964013567f/FLAG8c5c42347 [2025-03-04 06:47:41,564 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:47:41,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_24-evilcollapse_nr.i [2025-03-04 06:47:41,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ff38654/84a9f18722f9478abd493d964013567f/FLAG8c5c42347 [2025-03-04 06:47:41,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ff38654/84a9f18722f9478abd493d964013567f [2025-03-04 06:47:41,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:47:41,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:47:41,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:47:41,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:47:41,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:47:41,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:47:41" (1/1) ... [2025-03-04 06:47:41,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2217ad44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:41, skipping insertion in model container [2025-03-04 06:47:41,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:47:41" (1/1) ... [2025-03-04 06:47:41,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:47:42,235 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:42,236 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:42,236 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:42,237 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:42,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:47:42,283 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:47:42,320 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:42,320 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:42,321 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:42,323 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:42,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:47:42,373 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:47:42,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:42 WrapperNode [2025-03-04 06:47:42,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:47:42,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:47:42,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:47:42,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:47:42,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:42" (1/1) ... [2025-03-04 06:47:42,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:42" (1/1) ... [2025-03-04 06:47:42,413 INFO L138 Inliner]: procedures = 275, calls = 101, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 309 [2025-03-04 06:47:42,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:47:42,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:47:42,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:47:42,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:47:42,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:42" (1/1) ... [2025-03-04 06:47:42,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:42" (1/1) ... [2025-03-04 06:47:42,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:42" (1/1) ... [2025-03-04 06:47:42,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:42" (1/1) ... [2025-03-04 06:47:42,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:42" (1/1) ... [2025-03-04 06:47:42,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:42" (1/1) ... [2025-03-04 06:47:42,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:42" (1/1) ... [2025-03-04 06:47:42,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:42" (1/1) ... [2025-03-04 06:47:42,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:47:42,454 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:47:42,454 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:47:42,454 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:47:42,455 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:42" (1/1) ... [2025-03-04 06:47:42,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:47:42,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:42,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:47:42,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:47:42,507 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-04 06:47:42,507 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-04 06:47:42,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:47:42,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 06:47:42,507 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:47:42,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:47:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:47:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:47:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:47:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:47:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:47:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:47:42,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:47:42,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:47:42,509 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:47:42,615 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:47:42,616 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:47:43,075 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:47:43,075 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:47:43,103 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:47:43,103 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:47:43,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:47:43 BoogieIcfgContainer [2025-03-04 06:47:43,104 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:47:43,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:47:43,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:47:43,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:47:43,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:47:41" (1/3) ... [2025-03-04 06:47:43,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60700900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:47:43, skipping insertion in model container [2025-03-04 06:47:43,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:42" (2/3) ... [2025-03-04 06:47:43,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60700900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:47:43, skipping insertion in model container [2025-03-04 06:47:43,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:47:43" (3/3) ... [2025-03-04 06:47:43,113 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_24-evilcollapse_nr.i [2025-03-04 06:47:43,126 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:47:43,127 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-04 06:47:43,127 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:47:43,208 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:47:43,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 429 places, 433 transitions, 874 flow [2025-03-04 06:47:43,394 INFO L124 PetriNetUnfolderBase]: 11/431 cut-off events. [2025-03-04 06:47:43,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:43,408 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-04 06:47:43,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 429 places, 433 transitions, 874 flow [2025-03-04 06:47:43,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 427 places, 431 transitions, 868 flow [2025-03-04 06:47:43,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:47:43,435 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;@3b5cea70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:47:43,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 06:47:43,459 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:47:43,460 INFO L124 PetriNetUnfolderBase]: 0/113 cut-off events. [2025-03-04 06:47:43,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:43,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:43,461 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-04 06:47:43,461 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-04 06:47:43,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:43,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1346369321, now seen corresponding path program 1 times [2025-03-04 06:47:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:43,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608295595] [2025-03-04 06:47:43,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:43,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:43,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 06:47:43,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 06:47:43,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:43,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:44,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608295595] [2025-03-04 06:47:44,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608295595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:44,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:44,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:44,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581352939] [2025-03-04 06:47:44,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:44,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:44,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:44,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:44,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:44,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 433 [2025-03-04 06:47:44,732 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-04 06:47:44,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:44,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 433 [2025-03-04 06:47:44,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:45,123 INFO L124 PetriNetUnfolderBase]: 450/1903 cut-off events. [2025-03-04 06:47:45,124 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 06:47:45,128 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-04 06:47:45,134 INFO L140 encePairwiseOnDemand]: 417/433 looper letters, 80 selfloop transitions, 10 changer transitions 2/425 dead transitions. [2025-03-04 06:47:45,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 425 transitions, 1036 flow [2025-03-04 06:47:45,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2118 transitions. [2025-03-04 06:47:45,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.815242494226328 [2025-03-04 06:47:45,151 INFO L175 Difference]: Start difference. First operand has 427 places, 431 transitions, 868 flow. Second operand 6 states and 2118 transitions. [2025-03-04 06:47:45,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 425 transitions, 1036 flow [2025-03-04 06:47:45,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 425 transitions, 1034 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:47:45,166 INFO L231 Difference]: Finished difference. Result has 428 places, 423 transitions, 870 flow [2025-03-04 06:47:45,168 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-04 06:47:45,170 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 1 predicate places. [2025-03-04 06:47:45,171 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 423 transitions, 870 flow [2025-03-04 06:47:45,172 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-04 06:47:45,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:45,173 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-04 06:47:45,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:47:45,174 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-04 06:47:45,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:45,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2013362433, now seen corresponding path program 1 times [2025-03-04 06:47:45,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:45,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475674380] [2025-03-04 06:47:45,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:45,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:45,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 06:47:45,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 06:47:45,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:45,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:45,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:45,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475674380] [2025-03-04 06:47:45,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475674380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:45,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:45,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:45,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846810036] [2025-03-04 06:47:45,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:45,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:45,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:45,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:45,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:45,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 433 [2025-03-04 06:47:45,907 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-04 06:47:45,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:45,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 433 [2025-03-04 06:47:45,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:46,130 INFO L124 PetriNetUnfolderBase]: 450/1899 cut-off events. [2025-03-04 06:47:46,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:46,136 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-04 06:47:46,142 INFO L140 encePairwiseOnDemand]: 421/433 looper letters, 80 selfloop transitions, 10 changer transitions 0/421 dead transitions. [2025-03-04 06:47:46,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 421 transitions, 1046 flow [2025-03-04 06:47:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2114 transitions. [2025-03-04 06:47:46,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8137028483448807 [2025-03-04 06:47:46,150 INFO L175 Difference]: Start difference. First operand has 428 places, 423 transitions, 870 flow. Second operand 6 states and 2114 transitions. [2025-03-04 06:47:46,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 421 transitions, 1046 flow [2025-03-04 06:47:46,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 421 transitions, 1026 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:46,155 INFO L231 Difference]: Finished difference. Result has 424 places, 421 transitions, 866 flow [2025-03-04 06:47:46,156 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-04 06:47:46,156 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -3 predicate places. [2025-03-04 06:47:46,156 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 421 transitions, 866 flow [2025-03-04 06:47:46,158 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-04 06:47:46,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:46,160 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-04 06:47:46,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:47:46,161 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-04 06:47:46,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1494163021, now seen corresponding path program 1 times [2025-03-04 06:47:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:46,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285219246] [2025-03-04 06:47:46,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:46,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:46,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 06:47:46,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 06:47:46,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:46,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:46,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:46,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285219246] [2025-03-04 06:47:46,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285219246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:46,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:46,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:47:46,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146384119] [2025-03-04 06:47:46,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:46,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:47:46,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:46,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:47:46,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:47:46,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 433 [2025-03-04 06:47:46,273 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-04 06:47:46,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:46,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 433 [2025-03-04 06:47:46,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:46,344 INFO L124 PetriNetUnfolderBase]: 30/723 cut-off events. [2025-03-04 06:47:46,344 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:46,346 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-04 06:47:46,348 INFO L140 encePairwiseOnDemand]: 430/433 looper letters, 11 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-03-04 06:47:46,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 422 transitions, 894 flow [2025-03-04 06:47:46,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:47:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:47:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1265 transitions. [2025-03-04 06:47:46,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9738260200153964 [2025-03-04 06:47:46,351 INFO L175 Difference]: Start difference. First operand has 424 places, 421 transitions, 866 flow. Second operand 3 states and 1265 transitions. [2025-03-04 06:47:46,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 422 transitions, 894 flow [2025-03-04 06:47:46,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 422 transitions, 874 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:46,358 INFO L231 Difference]: Finished difference. Result has 422 places, 422 transitions, 858 flow [2025-03-04 06:47:46,359 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-04 06:47:46,361 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -5 predicate places. [2025-03-04 06:47:46,361 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 422 transitions, 858 flow [2025-03-04 06:47:46,362 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-04 06:47:46,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:46,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:46,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:47:46,362 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-04 06:47:46,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:46,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1543026234, now seen corresponding path program 1 times [2025-03-04 06:47:46,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:46,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861088514] [2025-03-04 06:47:46,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:46,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:46,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:47:46,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:47:46,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:46,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:46,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:46,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861088514] [2025-03-04 06:47:46,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861088514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:46,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:46,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:46,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293897662] [2025-03-04 06:47:46,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:46,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:46,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:46,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:46,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:47,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 433 [2025-03-04 06:47:47,057 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-04 06:47:47,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:47,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 433 [2025-03-04 06:47:47,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:47,269 INFO L124 PetriNetUnfolderBase]: 451/2021 cut-off events. [2025-03-04 06:47:47,269 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:47:47,272 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-04 06:47:47,277 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 87 selfloop transitions, 5 changer transitions 0/421 dead transitions. [2025-03-04 06:47:47,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 421 transitions, 1040 flow [2025-03-04 06:47:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2109 transitions. [2025-03-04 06:47:47,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8117782909930716 [2025-03-04 06:47:47,283 INFO L175 Difference]: Start difference. First operand has 422 places, 422 transitions, 858 flow. Second operand 6 states and 2109 transitions. [2025-03-04 06:47:47,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 421 transitions, 1040 flow [2025-03-04 06:47:47,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 421 transitions, 1038 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:47,288 INFO L231 Difference]: Finished difference. Result has 425 places, 421 transitions, 864 flow [2025-03-04 06:47:47,289 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-04 06:47:47,290 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -2 predicate places. [2025-03-04 06:47:47,290 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 421 transitions, 864 flow [2025-03-04 06:47:47,291 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-04 06:47:47,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:47,291 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-04 06:47:47,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:47:47,291 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-04 06:47:47,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:47,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2082666602, now seen corresponding path program 1 times [2025-03-04 06:47:47,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:47,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593601278] [2025-03-04 06:47:47,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:47,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:47,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 06:47:47,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 06:47:47,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:47,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:47,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:47,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593601278] [2025-03-04 06:47:47,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593601278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:47,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:47,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:47:47,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727615380] [2025-03-04 06:47:47,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:47,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:47:47,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:47,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:47:47,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:47:47,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 433 [2025-03-04 06:47:47,378 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-04 06:47:47,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:47,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 433 [2025-03-04 06:47:47,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:47,486 INFO L124 PetriNetUnfolderBase]: 30/909 cut-off events. [2025-03-04 06:47:47,488 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:47,489 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-04 06:47:47,491 INFO L140 encePairwiseOnDemand]: 430/433 looper letters, 11 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-03-04 06:47:47,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 422 transitions, 892 flow [2025-03-04 06:47:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:47:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:47:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1265 transitions. [2025-03-04 06:47:47,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9738260200153964 [2025-03-04 06:47:47,497 INFO L175 Difference]: Start difference. First operand has 425 places, 421 transitions, 864 flow. Second operand 3 states and 1265 transitions. [2025-03-04 06:47:47,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 422 transitions, 892 flow [2025-03-04 06:47:47,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 422 transitions, 882 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:47,504 INFO L231 Difference]: Finished difference. Result has 423 places, 422 transitions, 866 flow [2025-03-04 06:47:47,505 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-04 06:47:47,506 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -4 predicate places. [2025-03-04 06:47:47,506 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 422 transitions, 866 flow [2025-03-04 06:47:47,506 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-04 06:47:47,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:47,507 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-04 06:47:47,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:47:47,507 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-04 06:47:47,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash 430399053, now seen corresponding path program 1 times [2025-03-04 06:47:47,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:47,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247975913] [2025-03-04 06:47:47,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:47,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 06:47:47,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 06:47:47,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:47,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:47,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:47,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247975913] [2025-03-04 06:47:47,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247975913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:47,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:47,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:47,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732473965] [2025-03-04 06:47:47,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:47,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:47,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:47,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:47,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:48,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 433 [2025-03-04 06:47:48,395 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-04 06:47:48,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:48,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 433 [2025-03-04 06:47:48,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:48,527 INFO L124 PetriNetUnfolderBase]: 76/1221 cut-off events. [2025-03-04 06:47:48,528 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:47:48,530 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-04 06:47:48,532 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 54 selfloop transitions, 5 changer transitions 0/421 dead transitions. [2025-03-04 06:47:48,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 421 transitions, 982 flow [2025-03-04 06:47:48,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2274 transitions. [2025-03-04 06:47:48,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8752886836027713 [2025-03-04 06:47:48,536 INFO L175 Difference]: Start difference. First operand has 423 places, 422 transitions, 866 flow. Second operand 6 states and 2274 transitions. [2025-03-04 06:47:48,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 421 transitions, 982 flow [2025-03-04 06:47:48,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 421 transitions, 980 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:48,540 INFO L231 Difference]: Finished difference. Result has 426 places, 421 transitions, 872 flow [2025-03-04 06:47:48,541 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-04 06:47:48,541 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -1 predicate places. [2025-03-04 06:47:48,541 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 421 transitions, 872 flow [2025-03-04 06:47:48,542 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-04 06:47:48,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:48,542 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-04 06:47:48,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:47:48,543 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-04 06:47:48,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:48,543 INFO L85 PathProgramCache]: Analyzing trace with hash 6833578, now seen corresponding path program 1 times [2025-03-04 06:47:48,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:48,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431544486] [2025-03-04 06:47:48,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:48,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:48,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 06:47:48,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 06:47:48,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:48,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:48,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:48,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431544486] [2025-03-04 06:47:48,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431544486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:48,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:48,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:48,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280566778] [2025-03-04 06:47:48,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:48,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:48,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:48,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:48,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:49,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 433 [2025-03-04 06:47:49,272 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-04 06:47:49,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:49,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 433 [2025-03-04 06:47:49,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:49,501 INFO L124 PetriNetUnfolderBase]: 451/2201 cut-off events. [2025-03-04 06:47:49,501 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:47:49,505 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-04 06:47:49,511 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 87 selfloop transitions, 5 changer transitions 0/420 dead transitions. [2025-03-04 06:47:49,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 420 transitions, 1054 flow [2025-03-04 06:47:49,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2109 transitions. [2025-03-04 06:47:49,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8117782909930716 [2025-03-04 06:47:49,515 INFO L175 Difference]: Start difference. First operand has 426 places, 421 transitions, 872 flow. Second operand 6 states and 2109 transitions. [2025-03-04 06:47:49,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 420 transitions, 1054 flow [2025-03-04 06:47:49,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 420 transitions, 1044 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:49,520 INFO L231 Difference]: Finished difference. Result has 425 places, 420 transitions, 870 flow [2025-03-04 06:47:49,520 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-04 06:47:49,521 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -2 predicate places. [2025-03-04 06:47:49,521 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 420 transitions, 870 flow [2025-03-04 06:47:49,522 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-04 06:47:49,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:49,522 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-04 06:47:49,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:47:49,522 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-04 06:47:49,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:49,523 INFO L85 PathProgramCache]: Analyzing trace with hash 650457920, now seen corresponding path program 1 times [2025-03-04 06:47:49,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:49,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558559499] [2025-03-04 06:47:49,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:49,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:49,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 06:47:49,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 06:47:49,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:49,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:49,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:49,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558559499] [2025-03-04 06:47:49,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558559499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:49,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:49,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:49,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708839453] [2025-03-04 06:47:49,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:49,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:49,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:49,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:49,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:50,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 433 [2025-03-04 06:47:50,211 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-04 06:47:50,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:50,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 433 [2025-03-04 06:47:50,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:50,520 INFO L124 PetriNetUnfolderBase]: 451/2197 cut-off events. [2025-03-04 06:47:50,520 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:47:50,523 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-04 06:47:50,529 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 83 selfloop transitions, 5 changer transitions 0/419 dead transitions. [2025-03-04 06:47:50,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 419 transitions, 1044 flow [2025-03-04 06:47:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2129 transitions. [2025-03-04 06:47:50,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8194765204003079 [2025-03-04 06:47:50,534 INFO L175 Difference]: Start difference. First operand has 425 places, 420 transitions, 870 flow. Second operand 6 states and 2129 transitions. [2025-03-04 06:47:50,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 419 transitions, 1044 flow [2025-03-04 06:47:50,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 419 transitions, 1034 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:50,539 INFO L231 Difference]: Finished difference. Result has 424 places, 419 transitions, 868 flow [2025-03-04 06:47:50,539 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-04 06:47:50,540 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -3 predicate places. [2025-03-04 06:47:50,540 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 419 transitions, 868 flow [2025-03-04 06:47:50,541 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-04 06:47:50,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:50,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:50,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:47:50,542 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-04 06:47:50,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:50,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2106319920, now seen corresponding path program 1 times [2025-03-04 06:47:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:50,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105925596] [2025-03-04 06:47:50,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:50,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:50,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 06:47:50,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 06:47:50,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:50,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:50,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:50,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105925596] [2025-03-04 06:47:50,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105925596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:50,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:50,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:50,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036893217] [2025-03-04 06:47:50,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:50,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:50,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:50,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:50,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:51,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 433 [2025-03-04 06:47:51,233 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-04 06:47:51,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:51,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 433 [2025-03-04 06:47:51,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:51,423 INFO L124 PetriNetUnfolderBase]: 451/2193 cut-off events. [2025-03-04 06:47:51,423 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:51,427 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-04 06:47:51,434 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 83 selfloop transitions, 5 changer transitions 0/418 dead transitions. [2025-03-04 06:47:51,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 418 transitions, 1042 flow [2025-03-04 06:47:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2129 transitions. [2025-03-04 06:47:51,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8194765204003079 [2025-03-04 06:47:51,438 INFO L175 Difference]: Start difference. First operand has 424 places, 419 transitions, 868 flow. Second operand 6 states and 2129 transitions. [2025-03-04 06:47:51,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 418 transitions, 1042 flow [2025-03-04 06:47:51,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 418 transitions, 1032 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:51,443 INFO L231 Difference]: Finished difference. Result has 423 places, 418 transitions, 866 flow [2025-03-04 06:47:51,444 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-04 06:47:51,445 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -4 predicate places. [2025-03-04 06:47:51,445 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 418 transitions, 866 flow [2025-03-04 06:47:51,446 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-04 06:47:51,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:51,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:51,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:47:51,447 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-04 06:47:51,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:51,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1626202654, now seen corresponding path program 1 times [2025-03-04 06:47:51,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:51,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525850919] [2025-03-04 06:47:51,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:51,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 06:47:51,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 06:47:51,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:51,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:51,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:51,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525850919] [2025-03-04 06:47:51,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525850919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:51,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:51,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027968447] [2025-03-04 06:47:51,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:51,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:51,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:51,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:51,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:52,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 433 [2025-03-04 06:47:52,091 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-04 06:47:52,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:52,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 433 [2025-03-04 06:47:52,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:52,419 INFO L124 PetriNetUnfolderBase]: 451/2189 cut-off events. [2025-03-04 06:47:52,420 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:47:52,423 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-04 06:47:52,429 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 88 selfloop transitions, 5 changer transitions 0/417 dead transitions. [2025-03-04 06:47:52,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 417 transitions, 1050 flow [2025-03-04 06:47:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2104 transitions. [2025-03-04 06:47:52,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8098537336412626 [2025-03-04 06:47:52,433 INFO L175 Difference]: Start difference. First operand has 423 places, 418 transitions, 866 flow. Second operand 6 states and 2104 transitions. [2025-03-04 06:47:52,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 417 transitions, 1050 flow [2025-03-04 06:47:52,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 417 transitions, 1040 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:52,440 INFO L231 Difference]: Finished difference. Result has 422 places, 417 transitions, 864 flow [2025-03-04 06:47:52,441 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-04 06:47:52,442 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -5 predicate places. [2025-03-04 06:47:52,443 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 417 transitions, 864 flow [2025-03-04 06:47:52,444 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-04 06:47:52,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:52,444 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-04 06:47:52,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:47:52,444 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-04 06:47:52,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:52,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1341796710, now seen corresponding path program 1 times [2025-03-04 06:47:52,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:52,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248148356] [2025-03-04 06:47:52,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:52,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:52,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-04 06:47:52,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-04 06:47:52,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:52,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:52,624 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-04 06:47:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:52,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248148356] [2025-03-04 06:47:52,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248148356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:52,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407857279] [2025-03-04 06:47:52,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:52,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:52,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:52,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:47:52,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:47:52,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-04 06:47:52,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-04 06:47:52,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:52,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:52,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:47:52,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:52,985 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-04 06:47:52,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:53,106 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-04 06:47:53,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407857279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:53,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:53,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:47:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441735874] [2025-03-04 06:47:53,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:53,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:47:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:53,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:47:53,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:47:53,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 433 [2025-03-04 06:47:53,133 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-04 06:47:53,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:53,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 433 [2025-03-04 06:47:53,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:53,279 INFO L124 PetriNetUnfolderBase]: 30/1073 cut-off events. [2025-03-04 06:47:53,279 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:47:53,281 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-04 06:47:53,283 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 15 selfloop transitions, 9 changer transitions 0/425 dead transitions. [2025-03-04 06:47:53,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 425 transitions, 930 flow [2025-03-04 06:47:53,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:47:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:47:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3752 transitions. [2025-03-04 06:47:53,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627918911983577 [2025-03-04 06:47:53,288 INFO L175 Difference]: Start difference. First operand has 422 places, 417 transitions, 864 flow. Second operand 9 states and 3752 transitions. [2025-03-04 06:47:53,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 425 transitions, 930 flow [2025-03-04 06:47:53,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 425 transitions, 920 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:53,293 INFO L231 Difference]: Finished difference. Result has 428 places, 423 transitions, 904 flow [2025-03-04 06:47:53,293 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-04 06:47:53,294 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 1 predicate places. [2025-03-04 06:47:53,294 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 423 transitions, 904 flow [2025-03-04 06:47:53,295 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-04 06:47:53,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:53,295 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-04 06:47:53,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:47:53,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 06:47:53,496 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-04 06:47:53,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:53,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1443910352, now seen corresponding path program 2 times [2025-03-04 06:47:53,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:53,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216201965] [2025-03-04 06:47:53,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:53,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:53,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 407 statements into 2 equivalence classes. [2025-03-04 06:47:53,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 108 of 407 statements. [2025-03-04 06:47:53,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:53,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:53,741 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-04 06:47:53,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:53,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216201965] [2025-03-04 06:47:53,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216201965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:53,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:53,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:53,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929263290] [2025-03-04 06:47:53,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:53,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:53,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:53,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:53,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:54,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 433 [2025-03-04 06:47:54,641 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-04 06:47:54,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:54,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 433 [2025-03-04 06:47:54,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:54,819 INFO L124 PetriNetUnfolderBase]: 76/1388 cut-off events. [2025-03-04 06:47:54,819 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 06:47:54,821 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-04 06:47:54,823 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 54 selfloop transitions, 5 changer transitions 0/422 dead transitions. [2025-03-04 06:47:54,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 422 transitions, 1020 flow [2025-03-04 06:47:54,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2274 transitions. [2025-03-04 06:47:54,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8752886836027713 [2025-03-04 06:47:54,827 INFO L175 Difference]: Start difference. First operand has 428 places, 423 transitions, 904 flow. Second operand 6 states and 2274 transitions. [2025-03-04 06:47:54,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 422 transitions, 1020 flow [2025-03-04 06:47:54,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 422 transitions, 1014 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:54,832 INFO L231 Difference]: Finished difference. Result has 431 places, 422 transitions, 906 flow [2025-03-04 06:47:54,832 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-04 06:47:54,833 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 4 predicate places. [2025-03-04 06:47:54,833 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 422 transitions, 906 flow [2025-03-04 06:47:54,833 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-04 06:47:54,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:54,834 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-04 06:47:54,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:47:54,834 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-04 06:47:54,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash 691802021, now seen corresponding path program 1 times [2025-03-04 06:47:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:54,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571649909] [2025-03-04 06:47:54,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:54,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-04 06:47:54,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-04 06:47:54,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:54,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:55,126 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-04 06:47:55,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:55,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571649909] [2025-03-04 06:47:55,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571649909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:55,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941682166] [2025-03-04 06:47:55,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:55,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:55,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:55,129 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:47:55,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:47:55,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-04 06:47:55,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-04 06:47:55,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:55,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:55,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:47:55,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:55,722 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-04 06:47:55,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:56,045 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-04 06:47:56,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941682166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:56,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:56,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 06:47:56,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423369032] [2025-03-04 06:47:56,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:56,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 06:47:56,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:56,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 06:47:56,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-04 06:47:56,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 433 [2025-03-04 06:47:56,134 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-04 06:47:56,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:56,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 433 [2025-03-04 06:47:56,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:57,196 INFO L124 PetriNetUnfolderBase]: 31/2452 cut-off events. [2025-03-04 06:47:57,196 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-04 06:47:57,197 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-04 06:47:57,199 INFO L140 encePairwiseOnDemand]: 422/433 looper letters, 47 selfloop transitions, 68 changer transitions 0/508 dead transitions. [2025-03-04 06:47:57,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 508 transitions, 1546 flow [2025-03-04 06:47:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 06:47:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-04 06:47:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 25832 transitions. [2025-03-04 06:47:57,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9469555335606143 [2025-03-04 06:47:57,218 INFO L175 Difference]: Start difference. First operand has 431 places, 422 transitions, 906 flow. Second operand 63 states and 25832 transitions. [2025-03-04 06:47:57,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 508 transitions, 1546 flow [2025-03-04 06:47:57,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 508 transitions, 1536 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:57,225 INFO L231 Difference]: Finished difference. Result has 504 places, 484 transitions, 1416 flow [2025-03-04 06:47:57,225 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-04 06:47:57,226 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 77 predicate places. [2025-03-04 06:47:57,227 INFO L471 AbstractCegarLoop]: Abstraction has has 504 places, 484 transitions, 1416 flow [2025-03-04 06:47:57,229 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-04 06:47:57,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:57,234 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-04 06:47:57,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 06:47:57,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 06:47:57,435 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-04 06:47:57,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:57,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1066514419, now seen corresponding path program 2 times [2025-03-04 06:47:57,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:57,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827329376] [2025-03-04 06:47:57,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:57,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:57,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1426 statements into 2 equivalence classes. [2025-03-04 06:47:57,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 108 of 1426 statements. [2025-03-04 06:47:57,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:57,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:57,759 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-04 06:47:57,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:57,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827329376] [2025-03-04 06:47:57,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827329376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:57,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:57,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:57,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092994412] [2025-03-04 06:47:57,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:57,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:57,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:57,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:57,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:58,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 433 [2025-03-04 06:47:58,584 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-04 06:47:58,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:58,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 433 [2025-03-04 06:47:58,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:59,194 INFO L124 PetriNetUnfolderBase]: 77/2767 cut-off events. [2025-03-04 06:47:59,195 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-03-04 06:47:59,198 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-04 06:47:59,201 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 54 selfloop transitions, 5 changer transitions 0/483 dead transitions. [2025-03-04 06:47:59,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 483 transitions, 1532 flow [2025-03-04 06:47:59,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2274 transitions. [2025-03-04 06:47:59,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8752886836027713 [2025-03-04 06:47:59,203 INFO L175 Difference]: Start difference. First operand has 504 places, 484 transitions, 1416 flow. Second operand 6 states and 2274 transitions. [2025-03-04 06:47:59,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 483 transitions, 1532 flow [2025-03-04 06:47:59,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 483 transitions, 1456 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-04 06:47:59,211 INFO L231 Difference]: Finished difference. Result has 501 places, 483 transitions, 1348 flow [2025-03-04 06:47:59,211 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-04 06:47:59,212 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 74 predicate places. [2025-03-04 06:47:59,212 INFO L471 AbstractCegarLoop]: Abstraction has has 501 places, 483 transitions, 1348 flow [2025-03-04 06:47:59,213 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-04 06:47:59,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:59,213 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-04 06:47:59,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:47:59,214 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-04 06:47:59,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:59,216 INFO L85 PathProgramCache]: Analyzing trace with hash 303644116, now seen corresponding path program 1 times [2025-03-04 06:47:59,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:59,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130371440] [2025-03-04 06:47:59,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:59,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:59,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1460 statements into 1 equivalence classes. [2025-03-04 06:47:59,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1460 of 1460 statements. [2025-03-04 06:47:59,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:59,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:01,785 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-04 06:48:01,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:48:01,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130371440] [2025-03-04 06:48:01,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130371440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:48:01,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099806935] [2025-03-04 06:48:01,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:48:01,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:48:01,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:48:01,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:48:01,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:48:02,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1460 statements into 1 equivalence classes. [2025-03-04 06:48:02,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1460 of 1460 statements. [2025-03-04 06:48:02,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:48:02,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:02,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 5698 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:48:02,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:48:03,295 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-04 06:48:03,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:48:04,074 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-04 06:48:04,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099806935] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:48:04,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:48:04,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-04 06:48:04,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388979786] [2025-03-04 06:48:04,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:48:04,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 06:48:04,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:48:04,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 06:48:04,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 06:48:04,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 433 [2025-03-04 06:48:04,126 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-04 06:48:04,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:48:04,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 433 [2025-03-04 06:48:04,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:48:06,352 INFO L124 PetriNetUnfolderBase]: 31/4611 cut-off events. [2025-03-04 06:48:06,353 INFO L125 PetriNetUnfolderBase]: For 3207/3207 co-relation queries the response was YES. [2025-03-04 06:48:06,357 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-04 06:48:06,362 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 47 selfloop transitions, 135 changer transitions 0/584 dead transitions. [2025-03-04 06:48:06,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 584 transitions, 2476 flow [2025-03-04 06:48:06,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 06:48:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-04 06:48:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 18710 transitions. [2025-03-04 06:48:06,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9602258147292789 [2025-03-04 06:48:06,372 INFO L175 Difference]: Start difference. First operand has 501 places, 483 transitions, 1348 flow. Second operand 45 states and 18710 transitions. [2025-03-04 06:48:06,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 584 transitions, 2476 flow [2025-03-04 06:48:06,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 584 transitions, 2466 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:48:06,387 INFO L231 Difference]: Finished difference. Result has 549 places, 558 transitions, 2212 flow [2025-03-04 06:48:06,387 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-04 06:48:06,388 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 122 predicate places. [2025-03-04 06:48:06,388 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 558 transitions, 2212 flow [2025-03-04 06:48:06,390 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-04 06:48:06,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:48:06,391 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-04 06:48:06,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 06:48:06,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:48:06,592 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-04 06:48:06,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:48:06,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1192048428, now seen corresponding path program 2 times [2025-03-04 06:48:06,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:48:06,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363673169] [2025-03-04 06:48:06,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:48:06,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:48:06,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2900 statements into 2 equivalence classes. [2025-03-04 06:48:06,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 142 of 2900 statements. [2025-03-04 06:48:06,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:48:06,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:07,168 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-04 06:48:07,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:48:07,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363673169] [2025-03-04 06:48:07,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363673169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:48:07,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:48:07,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:48:07,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685538140] [2025-03-04 06:48:07,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:48:07,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:48:07,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:48:07,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:48:07,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:48:08,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 433 [2025-03-04 06:48:08,115 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-04 06:48:08,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:48:08,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 433 [2025-03-04 06:48:08,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:48:10,777 INFO L124 PetriNetUnfolderBase]: 201/5512 cut-off events. [2025-03-04 06:48:10,777 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-03-04 06:48:10,784 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-04 06:48:10,790 INFO L140 encePairwiseOnDemand]: 421/433 looper letters, 71 selfloop transitions, 23 changer transitions 0/593 dead transitions. [2025-03-04 06:48:10,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 593 transitions, 2478 flow [2025-03-04 06:48:10,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:48:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:48:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2315 transitions. [2025-03-04 06:48:10,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8910700538876059 [2025-03-04 06:48:10,795 INFO L175 Difference]: Start difference. First operand has 549 places, 558 transitions, 2212 flow. Second operand 6 states and 2315 transitions. [2025-03-04 06:48:10,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 593 transitions, 2478 flow [2025-03-04 06:48:10,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 593 transitions, 2370 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-04 06:48:10,811 INFO L231 Difference]: Finished difference. Result has 541 places, 580 transitions, 2262 flow [2025-03-04 06:48:10,812 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-04 06:48:10,812 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 114 predicate places. [2025-03-04 06:48:10,812 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 580 transitions, 2262 flow [2025-03-04 06:48:10,813 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-04 06:48:10,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:48:10,814 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-04 06:48:10,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:48:10,814 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-04 06:48:10,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:48:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1451090776, now seen corresponding path program 1 times [2025-03-04 06:48:10,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:48:10,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179291988] [2025-03-04 06:48:10,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:48:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:48:11,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2906 statements into 1 equivalence classes. [2025-03-04 06:48:11,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2906 of 2906 statements. [2025-03-04 06:48:11,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:48:11,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:21,647 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-04 06:48:21,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:48:21,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179291988] [2025-03-04 06:48:21,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179291988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:48:21,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020817109] [2025-03-04 06:48:21,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:48:21,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:48:21,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:48:21,650 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:48:21,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:48:22,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2906 statements into 1 equivalence classes. [2025-03-04 06:48:23,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2906 of 2906 statements. [2025-03-04 06:48:23,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:48:23,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:23,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 11604 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 06:48:24,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:48:25,154 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-04 06:48:25,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:48:26,856 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-04 06:48:26,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020817109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:48:26,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:48:26,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-04 06:48:26,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408782932] [2025-03-04 06:48:26,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:48:26,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-04 06:48:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:48:26,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-04 06:48:26,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 06:48:26,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 433 [2025-03-04 06:48:26,944 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-04 06:48:26,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:48:26,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 433 [2025-03-04 06:48:26,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:48:34,719 INFO L124 PetriNetUnfolderBase]: 187/9720 cut-off events. [2025-03-04 06:48:34,719 INFO L125 PetriNetUnfolderBase]: For 13429/13433 co-relation queries the response was YES. [2025-03-04 06:48:34,732 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-04 06:48:34,742 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 92 selfloop transitions, 270 changer transitions 0/786 dead transitions. [2025-03-04 06:48:34,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 786 transitions, 5172 flow [2025-03-04 06:48:34,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-04 06:48:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-04 06:48:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 37407 transitions. [2025-03-04 06:48:34,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9598922247882987 [2025-03-04 06:48:34,759 INFO L175 Difference]: Start difference. First operand has 541 places, 580 transitions, 2262 flow. Second operand 90 states and 37407 transitions. [2025-03-04 06:48:34,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 786 transitions, 5172 flow [2025-03-04 06:48:34,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 786 transitions, 5172 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:48:34,785 INFO L231 Difference]: Finished difference. Result has 646 places, 718 transitions, 4254 flow [2025-03-04 06:48:34,786 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-04 06:48:34,787 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 219 predicate places. [2025-03-04 06:48:34,787 INFO L471 AbstractCegarLoop]: Abstraction has has 646 places, 718 transitions, 4254 flow [2025-03-04 06:48:34,792 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-04 06:48:34,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:48:34,794 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-04 06:48:34,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 06:48:34,994 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-04 06:48:34,994 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-04 06:48:35,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:48:35,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2137761336, now seen corresponding path program 2 times [2025-03-04 06:48:35,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:48:35,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569124234] [2025-03-04 06:48:35,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:48:35,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:48:35,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5606 statements into 2 equivalence classes. [2025-03-04 06:48:35,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 148 of 5606 statements. [2025-03-04 06:48:35,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:48:35,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:35,768 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-04 06:48:35,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:48:35,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569124234] [2025-03-04 06:48:35,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569124234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:48:35,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:48:35,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:48:35,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420051906] [2025-03-04 06:48:35,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:48:35,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:48:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:48:35,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:48:35,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:48:36,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 433 [2025-03-04 06:48:36,683 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-04 06:48:36,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:48:36,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 433 [2025-03-04 06:48:36,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:48:45,939 INFO L124 PetriNetUnfolderBase]: 312/10276 cut-off events. [2025-03-04 06:48:45,939 INFO L125 PetriNetUnfolderBase]: For 3812/3845 co-relation queries the response was YES. [2025-03-04 06:48:45,959 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-04 06:48:45,974 INFO L140 encePairwiseOnDemand]: 421/433 looper letters, 84 selfloop transitions, 31 changer transitions 0/757 dead transitions. [2025-03-04 06:48:45,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 757 transitions, 4604 flow [2025-03-04 06:48:45,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:48:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:48:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2311 transitions. [2025-03-04 06:48:45,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8895304080061586 [2025-03-04 06:48:45,979 INFO L175 Difference]: Start difference. First operand has 646 places, 718 transitions, 4254 flow. Second operand 6 states and 2311 transitions. [2025-03-04 06:48:45,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 757 transitions, 4604 flow [2025-03-04 06:48:46,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 757 transitions, 4250 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-04 06:48:46,020 INFO L231 Difference]: Finished difference. Result has 614 places, 748 transitions, 4158 flow [2025-03-04 06:48:46,020 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-04 06:48:46,021 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 187 predicate places. [2025-03-04 06:48:46,021 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 748 transitions, 4158 flow [2025-03-04 06:48:46,021 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-04 06:48:46,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:48:46,023 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-04 06:48:46,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:48:46,023 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-04 06:48:46,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:48:46,039 INFO L85 PathProgramCache]: Analyzing trace with hash -372556868, now seen corresponding path program 1 times [2025-03-04 06:48:46,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:48:46,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725031998] [2025-03-04 06:48:46,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:48:46,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:48:46,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5610 statements into 1 equivalence classes. [2025-03-04 06:48:47,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5610 of 5610 statements. [2025-03-04 06:48:47,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:48:47,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:00,023 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-04 06:49:00,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:00,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725031998] [2025-03-04 06:49:00,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725031998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:49:00,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852771461] [2025-03-04 06:49:00,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:00,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:49:00,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:49:00,027 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-04 06:49:00,028 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-04 06:49:02,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5610 statements into 1 equivalence classes. [2025-03-04 06:49:04,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5610 of 5610 statements. [2025-03-04 06:49:04,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:04,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:04,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 22662 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 06:49:04,549 INFO L279 TraceCheckSpWp]: Computing forward predicates...