./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-commit-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-commit-2.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ec2334e7e9ec2636c6abf161aed91fff94fbff3709d38c7edad92256c3b5dc81 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:00,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:00,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:33:00,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:00,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:00,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:00,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:00,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:00,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:00,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:00,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:00,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:00,504 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:00,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:00,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:00,505 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:00,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:00,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:00,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:00,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:00,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:00,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:00,505 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:00,505 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:00,505 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:00,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:00,505 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:00,506 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:00,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:00,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:00,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:00,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:00,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:00,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:00,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:00,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:00,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:00,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:00,506 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:00,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:00,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:00,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:00,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:00,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:00,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:00,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:00,507 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-jdk21/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 -> ec2334e7e9ec2636c6abf161aed91fff94fbff3709d38c7edad92256c3b5dc81 [2025-01-09 21:33:00,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:00,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:00,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:00,759 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:00,759 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:00,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-commit-2.wvr.c [2025-01-09 21:33:01,936 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4429a1d96/35ea58503cb54d2dbccd24c417bb381d/FLAGd2fee1467 [2025-01-09 21:33:02,179 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:02,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-2.wvr.c [2025-01-09 21:33:02,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4429a1d96/35ea58503cb54d2dbccd24c417bb381d/FLAGd2fee1467 [2025-01-09 21:33:02,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4429a1d96/35ea58503cb54d2dbccd24c417bb381d [2025-01-09 21:33:02,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:02,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:02,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:02,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:02,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:02,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:02" (1/1) ... [2025-01-09 21:33:02,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c7e046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02, skipping insertion in model container [2025-01-09 21:33:02,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:02" (1/1) ... [2025-01-09 21:33:02,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:02,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:02,416 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:02,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:02,489 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:02,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02 WrapperNode [2025-01-09 21:33:02,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:02,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:02,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:02,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:02,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02" (1/1) ... [2025-01-09 21:33:02,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02" (1/1) ... [2025-01-09 21:33:02,534 INFO L138 Inliner]: procedures = 25, calls = 74, calls flagged for inlining = 28, calls inlined = 34, statements flattened = 977 [2025-01-09 21:33:02,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:02,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:02,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:02,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:02,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02" (1/1) ... [2025-01-09 21:33:02,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02" (1/1) ... [2025-01-09 21:33:02,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02" (1/1) ... [2025-01-09 21:33:02,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02" (1/1) ... [2025-01-09 21:33:02,573 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02" (1/1) ... [2025-01-09 21:33:02,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02" (1/1) ... [2025-01-09 21:33:02,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02" (1/1) ... [2025-01-09 21:33:02,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02" (1/1) ... [2025-01-09 21:33:02,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02" (1/1) ... [2025-01-09 21:33:02,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:02,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:02,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:02,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:02,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02" (1/1) ... [2025-01-09 21:33:02,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:02,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:02,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:33:02,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:33:02,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:02,660 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:02,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:02,660 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:02,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:02,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:02,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:02,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:33:02,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:33:02,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:02,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:02,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:33:02,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:33:02,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:02,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:02,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:02,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:02,663 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:33:02,764 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:02,767 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:03,857 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:03,858 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:04,735 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:04,735 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:33:04,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:04 BoogieIcfgContainer [2025-01-09 21:33:04,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:04,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:04,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:04,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:04,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:02" (1/3) ... [2025-01-09 21:33:04,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259a617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:04, skipping insertion in model container [2025-01-09 21:33:04,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:02" (2/3) ... [2025-01-09 21:33:04,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259a617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:04, skipping insertion in model container [2025-01-09 21:33:04,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:04" (3/3) ... [2025-01-09 21:33:04,742 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2025-01-09 21:33:04,753 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:04,754 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-commit-2.wvr.c that has 5 procedures, 602 locations, 1 initial locations, 8 loop locations, and 164 error locations. [2025-01-09 21:33:04,754 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:04,921 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:33:04,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 614 places, 622 transitions, 1272 flow [2025-01-09 21:33:05,133 INFO L124 PetriNetUnfolderBase]: 21/618 cut-off events. [2025-01-09 21:33:05,135 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:33:05,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 618 events. 21/618 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1104 event pairs, 0 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 564. Up to 2 conditions per place. [2025-01-09 21:33:05,142 INFO L82 GeneralOperation]: Start removeDead. Operand has 614 places, 622 transitions, 1272 flow [2025-01-09 21:33:05,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 594 places, 601 transitions, 1226 flow [2025-01-09 21:33:05,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:05,164 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;@5df36ab0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:05,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 300 error locations. [2025-01-09 21:33:05,169 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:05,170 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-01-09 21:33:05,170 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:05,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:05,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:05,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:05,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash -667629822, now seen corresponding path program 1 times [2025-01-09 21:33:05,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:05,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431349026] [2025-01-09 21:33:05,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:05,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:05,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:33:05,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:33:05,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:05,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:05,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:05,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431349026] [2025-01-09 21:33:05,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431349026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:05,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:05,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:05,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930852380] [2025-01-09 21:33:05,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:05,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:05,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:05,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:05,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:05,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-01-09 21:33:05,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 601 transitions, 1226 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:05,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:05,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-01-09 21:33:05,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:06,172 INFO L124 PetriNetUnfolderBase]: 890/3115 cut-off events. [2025-01-09 21:33:06,172 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-01-09 21:33:06,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4549 conditions, 3115 events. 890/3115 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 23240 event pairs, 527 based on Foata normal form. 574/3379 useless extension candidates. Maximal degree in co-relation 3611. Up to 1190 conditions per place. [2025-01-09 21:33:06,194 INFO L140 encePairwiseOnDemand]: 475/622 looper letters, 24 selfloop transitions, 2 changer transitions 8/456 dead transitions. [2025-01-09 21:33:06,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 456 transitions, 988 flow [2025-01-09 21:33:06,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:06,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1515 transitions. [2025-01-09 21:33:06,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8118971061093248 [2025-01-09 21:33:06,208 INFO L175 Difference]: Start difference. First operand has 594 places, 601 transitions, 1226 flow. Second operand 3 states and 1515 transitions. [2025-01-09 21:33:06,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 456 transitions, 988 flow [2025-01-09 21:33:06,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 456 transitions, 972 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 21:33:06,220 INFO L231 Difference]: Finished difference. Result has 455 places, 448 transitions, 908 flow [2025-01-09 21:33:06,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=455, PETRI_TRANSITIONS=448} [2025-01-09 21:33:06,225 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -139 predicate places. [2025-01-09 21:33:06,225 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 448 transitions, 908 flow [2025-01-09 21:33:06,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:06,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:06,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:06,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:06,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:06,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:06,227 INFO L85 PathProgramCache]: Analyzing trace with hash 980708185, now seen corresponding path program 1 times [2025-01-09 21:33:06,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:06,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826043997] [2025-01-09 21:33:06,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:06,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:06,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:33:06,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:33:06,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:06,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:06,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:06,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826043997] [2025-01-09 21:33:06,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826043997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:06,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:06,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:06,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11168051] [2025-01-09 21:33:06,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:06,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:06,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:06,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:06,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-01-09 21:33:06,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 448 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:06,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:06,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-01-09 21:33:06,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:06,956 INFO L124 PetriNetUnfolderBase]: 890/3106 cut-off events. [2025-01-09 21:33:06,956 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-01-09 21:33:06,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4382 conditions, 3106 events. 890/3106 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 23292 event pairs, 527 based on Foata normal form. 0/2805 useless extension candidates. Maximal degree in co-relation 4340. Up to 1190 conditions per place. [2025-01-09 21:33:06,979 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 24 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2025-01-09 21:33:06,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 447 transitions, 958 flow [2025-01-09 21:33:06,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-01-09 21:33:06,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-01-09 21:33:06,983 INFO L175 Difference]: Start difference. First operand has 455 places, 448 transitions, 908 flow. Second operand 3 states and 1371 transitions. [2025-01-09 21:33:06,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 447 transitions, 958 flow [2025-01-09 21:33:06,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 447 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:06,994 INFO L231 Difference]: Finished difference. Result has 446 places, 447 transitions, 906 flow [2025-01-09 21:33:06,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=906, PETRI_PLACES=446, PETRI_TRANSITIONS=447} [2025-01-09 21:33:06,996 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -148 predicate places. [2025-01-09 21:33:06,996 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 447 transitions, 906 flow [2025-01-09 21:33:06,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:06,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:06,997 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] [2025-01-09 21:33:06,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:06,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:06,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash -894296377, now seen corresponding path program 1 times [2025-01-09 21:33:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:06,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929263290] [2025-01-09 21:33:06,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:06,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:07,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:33:07,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:33:07,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:07,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:07,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:07,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929263290] [2025-01-09 21:33:07,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929263290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:07,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:07,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:07,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349295973] [2025-01-09 21:33:07,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:07,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:07,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:07,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:07,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:07,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-01-09 21:33:07,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 447 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:07,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:07,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-01-09 21:33:07,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:07,579 INFO L124 PetriNetUnfolderBase]: 890/3105 cut-off events. [2025-01-09 21:33:07,579 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-01-09 21:33:07,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4381 conditions, 3105 events. 890/3105 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 23274 event pairs, 527 based on Foata normal form. 0/2805 useless extension candidates. Maximal degree in co-relation 4331. Up to 1190 conditions per place. [2025-01-09 21:33:07,599 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 24 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2025-01-09 21:33:07,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 446 transitions, 956 flow [2025-01-09 21:33:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-01-09 21:33:07,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-01-09 21:33:07,603 INFO L175 Difference]: Start difference. First operand has 446 places, 447 transitions, 906 flow. Second operand 3 states and 1371 transitions. [2025-01-09 21:33:07,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 446 transitions, 956 flow [2025-01-09 21:33:07,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 446 transitions, 952 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:07,608 INFO L231 Difference]: Finished difference. Result has 445 places, 446 transitions, 904 flow [2025-01-09 21:33:07,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=445, PETRI_TRANSITIONS=446} [2025-01-09 21:33:07,609 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -149 predicate places. [2025-01-09 21:33:07,609 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 446 transitions, 904 flow [2025-01-09 21:33:07,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:07,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:07,610 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] [2025-01-09 21:33:07,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:07,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:07,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:07,611 INFO L85 PathProgramCache]: Analyzing trace with hash -651985922, now seen corresponding path program 1 times [2025-01-09 21:33:07,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:07,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500156776] [2025-01-09 21:33:07,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:07,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:07,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:33:07,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:33:07,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:07,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:07,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:07,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500156776] [2025-01-09 21:33:07,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500156776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:07,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:07,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646369405] [2025-01-09 21:33:07,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:07,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:07,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:07,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:07,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:07,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-01-09 21:33:07,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 446 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:07,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:07,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-01-09 21:33:07,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:08,076 INFO L124 PetriNetUnfolderBase]: 1024/2611 cut-off events. [2025-01-09 21:33:08,076 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-09 21:33:08,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4083 conditions, 2611 events. 1024/2611 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15618 event pairs, 128 based on Foata normal form. 0/2460 useless extension candidates. Maximal degree in co-relation 4025. Up to 1122 conditions per place. [2025-01-09 21:33:08,092 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 35 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2025-01-09 21:33:08,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 459 transitions, 1011 flow [2025-01-09 21:33:08,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1394 transitions. [2025-01-09 21:33:08,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7470525187566989 [2025-01-09 21:33:08,095 INFO L175 Difference]: Start difference. First operand has 445 places, 446 transitions, 904 flow. Second operand 3 states and 1394 transitions. [2025-01-09 21:33:08,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 459 transitions, 1011 flow [2025-01-09 21:33:08,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 459 transitions, 1007 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:08,101 INFO L231 Difference]: Finished difference. Result has 445 places, 446 transitions, 908 flow [2025-01-09 21:33:08,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=445, PETRI_TRANSITIONS=446} [2025-01-09 21:33:08,103 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -149 predicate places. [2025-01-09 21:33:08,103 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 446 transitions, 908 flow [2025-01-09 21:33:08,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:08,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:08,104 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] [2025-01-09 21:33:08,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:08,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:08,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:08,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1759761530, now seen corresponding path program 1 times [2025-01-09 21:33:08,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:08,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423369032] [2025-01-09 21:33:08,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:08,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:08,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:33:08,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:33:08,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:08,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:08,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:08,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423369032] [2025-01-09 21:33:08,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423369032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:08,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:08,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:08,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353617917] [2025-01-09 21:33:08,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:08,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:08,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:08,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:08,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:08,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-01-09 21:33:08,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 446 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:08,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:08,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-01-09 21:33:08,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:08,644 INFO L124 PetriNetUnfolderBase]: 979/3355 cut-off events. [2025-01-09 21:33:08,644 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-01-09 21:33:08,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4869 conditions, 3355 events. 979/3355 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 25542 event pairs, 595 based on Foata normal form. 0/3041 useless extension candidates. Maximal degree in co-relation 3506. Up to 1319 conditions per place. [2025-01-09 21:33:08,658 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 24 selfloop transitions, 2 changer transitions 0/445 dead transitions. [2025-01-09 21:33:08,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 445 transitions, 958 flow [2025-01-09 21:33:08,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-01-09 21:33:08,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-01-09 21:33:08,663 INFO L175 Difference]: Start difference. First operand has 445 places, 446 transitions, 908 flow. Second operand 3 states and 1373 transitions. [2025-01-09 21:33:08,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 445 transitions, 958 flow [2025-01-09 21:33:08,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 445 transitions, 956 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:08,669 INFO L231 Difference]: Finished difference. Result has 445 places, 445 transitions, 908 flow [2025-01-09 21:33:08,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=445, PETRI_TRANSITIONS=445} [2025-01-09 21:33:08,670 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -149 predicate places. [2025-01-09 21:33:08,670 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 445 transitions, 908 flow [2025-01-09 21:33:08,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:08,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:08,671 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] [2025-01-09 21:33:08,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:08,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:08,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:08,671 INFO L85 PathProgramCache]: Analyzing trace with hash 688073501, now seen corresponding path program 1 times [2025-01-09 21:33:08,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:08,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440954836] [2025-01-09 21:33:08,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:08,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:08,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:33:08,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:33:08,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:08,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:08,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:08,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:08,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440954836] [2025-01-09 21:33:08,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440954836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:08,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:08,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:08,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264152970] [2025-01-09 21:33:08,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:08,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:08,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:08,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:08,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:08,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-01-09 21:33:08,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 445 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:08,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:08,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-01-09 21:33:08,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:09,417 INFO L124 PetriNetUnfolderBase]: 979/3354 cut-off events. [2025-01-09 21:33:09,417 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-01-09 21:33:09,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4833 conditions, 3354 events. 979/3354 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 25611 event pairs, 595 based on Foata normal form. 0/3041 useless extension candidates. Maximal degree in co-relation 4766. Up to 1317 conditions per place. [2025-01-09 21:33:09,444 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 23 selfloop transitions, 1 changer transitions 0/444 dead transitions. [2025-01-09 21:33:09,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 444 transitions, 954 flow [2025-01-09 21:33:09,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2025-01-09 21:33:09,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395498392282959 [2025-01-09 21:33:09,447 INFO L175 Difference]: Start difference. First operand has 445 places, 445 transitions, 908 flow. Second operand 3 states and 1380 transitions. [2025-01-09 21:33:09,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 444 transitions, 954 flow [2025-01-09 21:33:09,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 444 transitions, 950 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:09,454 INFO L231 Difference]: Finished difference. Result has 444 places, 444 transitions, 904 flow [2025-01-09 21:33:09,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=444, PETRI_TRANSITIONS=444} [2025-01-09 21:33:09,455 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -150 predicate places. [2025-01-09 21:33:09,456 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 444 transitions, 904 flow [2025-01-09 21:33:09,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:09,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:09,457 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] [2025-01-09 21:33:09,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:09,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:09,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:09,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1247456633, now seen corresponding path program 1 times [2025-01-09 21:33:09,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:09,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113383685] [2025-01-09 21:33:09,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:09,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:09,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 21:33:09,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 21:33:09,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:09,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:09,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:09,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113383685] [2025-01-09 21:33:09,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113383685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:09,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:09,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:09,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516011257] [2025-01-09 21:33:09,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:09,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:09,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:09,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:09,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:09,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-01-09 21:33:09,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 444 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:09,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:09,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-01-09 21:33:09,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:09,995 INFO L124 PetriNetUnfolderBase]: 979/3353 cut-off events. [2025-01-09 21:33:09,996 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-01-09 21:33:10,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4833 conditions, 3353 events. 979/3353 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 25606 event pairs, 595 based on Foata normal form. 0/3041 useless extension candidates. Maximal degree in co-relation 4766. Up to 1319 conditions per place. [2025-01-09 21:33:10,016 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 24 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2025-01-09 21:33:10,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 443 transitions, 954 flow [2025-01-09 21:33:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-01-09 21:33:10,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-01-09 21:33:10,019 INFO L175 Difference]: Start difference. First operand has 444 places, 444 transitions, 904 flow. Second operand 3 states and 1373 transitions. [2025-01-09 21:33:10,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 443 transitions, 954 flow [2025-01-09 21:33:10,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 443 transitions, 953 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:10,024 INFO L231 Difference]: Finished difference. Result has 444 places, 443 transitions, 905 flow [2025-01-09 21:33:10,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=905, PETRI_PLACES=444, PETRI_TRANSITIONS=443} [2025-01-09 21:33:10,025 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -150 predicate places. [2025-01-09 21:33:10,025 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 443 transitions, 905 flow [2025-01-09 21:33:10,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:10,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:10,026 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] [2025-01-09 21:33:10,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:10,026 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:10,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:10,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1384031267, now seen corresponding path program 1 times [2025-01-09 21:33:10,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:10,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624145743] [2025-01-09 21:33:10,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:10,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:10,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 21:33:10,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 21:33:10,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:10,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:10,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:10,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624145743] [2025-01-09 21:33:10,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624145743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:10,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:10,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203638244] [2025-01-09 21:33:10,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:10,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:10,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:10,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:10,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:10,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 622 [2025-01-09 21:33:10,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 443 transitions, 905 flow. Second operand has 6 states, 6 states have (on average 401.5) internal successors, (2409), 6 states have internal predecessors, (2409), 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-01-09 21:33:10,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:10,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 622 [2025-01-09 21:33:10,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:11,202 INFO L124 PetriNetUnfolderBase]: 979/3349 cut-off events. [2025-01-09 21:33:11,202 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-01-09 21:33:11,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4878 conditions, 3349 events. 979/3349 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 25552 event pairs, 595 based on Foata normal form. 0/3041 useless extension candidates. Maximal degree in co-relation 4812. Up to 1348 conditions per place. [2025-01-09 21:33:11,218 INFO L140 encePairwiseOnDemand]: 598/622 looper letters, 53 selfloop transitions, 20 changer transitions 0/439 dead transitions. [2025-01-09 21:33:11,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 439 transitions, 1043 flow [2025-01-09 21:33:11,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2476 transitions. [2025-01-09 21:33:11,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6634512325830654 [2025-01-09 21:33:11,222 INFO L175 Difference]: Start difference. First operand has 444 places, 443 transitions, 905 flow. Second operand 6 states and 2476 transitions. [2025-01-09 21:33:11,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 439 transitions, 1043 flow [2025-01-09 21:33:11,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 439 transitions, 1039 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:11,228 INFO L231 Difference]: Finished difference. Result has 443 places, 439 transitions, 933 flow [2025-01-09 21:33:11,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=933, PETRI_PLACES=443, PETRI_TRANSITIONS=439} [2025-01-09 21:33:11,230 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -151 predicate places. [2025-01-09 21:33:11,230 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 439 transitions, 933 flow [2025-01-09 21:33:11,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 401.5) internal successors, (2409), 6 states have internal predecessors, (2409), 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-01-09 21:33:11,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:11,239 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] [2025-01-09 21:33:11,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:11,239 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:11,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:11,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1381175871, now seen corresponding path program 1 times [2025-01-09 21:33:11,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:11,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420051906] [2025-01-09 21:33:11,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:11,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:11,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:33:11,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:33:11,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:11,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:11,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:11,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420051906] [2025-01-09 21:33:11,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420051906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:11,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:11,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:11,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163927089] [2025-01-09 21:33:11,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:11,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:11,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:11,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:11,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:11,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-01-09 21:33:11,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 439 transitions, 933 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:11,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:11,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-01-09 21:33:11,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:11,735 INFO L124 PetriNetUnfolderBase]: 979/3348 cut-off events. [2025-01-09 21:33:11,736 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-01-09 21:33:11,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4849 conditions, 3348 events. 979/3348 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 25559 event pairs, 595 based on Foata normal form. 0/3041 useless extension candidates. Maximal degree in co-relation 4785. Up to 1320 conditions per place. [2025-01-09 21:33:11,750 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/438 dead transitions. [2025-01-09 21:33:11,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 438 transitions, 985 flow [2025-01-09 21:33:11,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-01-09 21:33:11,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-01-09 21:33:11,753 INFO L175 Difference]: Start difference. First operand has 443 places, 439 transitions, 933 flow. Second operand 3 states and 1371 transitions. [2025-01-09 21:33:11,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 438 transitions, 985 flow [2025-01-09 21:33:11,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 438 transitions, 945 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:11,759 INFO L231 Difference]: Finished difference. Result has 439 places, 438 transitions, 895 flow [2025-01-09 21:33:11,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=895, PETRI_PLACES=439, PETRI_TRANSITIONS=438} [2025-01-09 21:33:11,761 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -155 predicate places. [2025-01-09 21:33:11,761 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 438 transitions, 895 flow [2025-01-09 21:33:11,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:11,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:11,762 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-01-09 21:33:11,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:11,762 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:11,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash -133265291, now seen corresponding path program 1 times [2025-01-09 21:33:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:11,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310042124] [2025-01-09 21:33:11,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:11,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:11,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 21:33:11,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 21:33:11,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:11,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:11,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:11,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310042124] [2025-01-09 21:33:11,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310042124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:11,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:11,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:11,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718882681] [2025-01-09 21:33:11,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:11,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:11,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:11,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:11,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:11,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-01-09 21:33:11,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 438 transitions, 895 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:11,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:11,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-01-09 21:33:11,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:12,396 INFO L124 PetriNetUnfolderBase]: 1272/3880 cut-off events. [2025-01-09 21:33:12,396 INFO L125 PetriNetUnfolderBase]: For 213/213 co-relation queries the response was YES. [2025-01-09 21:33:12,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5774 conditions, 3880 events. 1272/3880 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 30026 event pairs, 437 based on Foata normal form. 0/3588 useless extension candidates. Maximal degree in co-relation 5708. Up to 911 conditions per place. [2025-01-09 21:33:12,413 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 39 selfloop transitions, 2 changer transitions 0/454 dead transitions. [2025-01-09 21:33:12,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 454 transitions, 1017 flow [2025-01-09 21:33:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2025-01-09 21:33:12,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7481243301178992 [2025-01-09 21:33:12,416 INFO L175 Difference]: Start difference. First operand has 439 places, 438 transitions, 895 flow. Second operand 3 states and 1396 transitions. [2025-01-09 21:33:12,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 454 transitions, 1017 flow [2025-01-09 21:33:12,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 454 transitions, 1013 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:12,421 INFO L231 Difference]: Finished difference. Result has 439 places, 438 transitions, 899 flow [2025-01-09 21:33:12,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=439, PETRI_TRANSITIONS=438} [2025-01-09 21:33:12,422 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -155 predicate places. [2025-01-09 21:33:12,422 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 438 transitions, 899 flow [2025-01-09 21:33:12,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:12,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:12,423 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] [2025-01-09 21:33:12,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:33:12,423 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:12,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:12,423 INFO L85 PathProgramCache]: Analyzing trace with hash -906049896, now seen corresponding path program 1 times [2025-01-09 21:33:12,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:12,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501163412] [2025-01-09 21:33:12,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:12,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:12,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:33:12,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:33:12,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:12,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:12,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:12,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501163412] [2025-01-09 21:33:12,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501163412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:12,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:12,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:12,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747985100] [2025-01-09 21:33:12,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:12,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:12,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:12,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:12,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:12,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-01-09 21:33:12,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 438 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:12,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:12,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-01-09 21:33:12,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:13,180 INFO L124 PetriNetUnfolderBase]: 1272/3815 cut-off events. [2025-01-09 21:33:13,180 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2025-01-09 21:33:13,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5978 conditions, 3815 events. 1272/3815 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 29259 event pairs, 821 based on Foata normal form. 0/3501 useless extension candidates. Maximal degree in co-relation 5910. Up to 1712 conditions per place. [2025-01-09 21:33:13,199 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/437 dead transitions. [2025-01-09 21:33:13,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 437 transitions, 951 flow [2025-01-09 21:33:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-01-09 21:33:13,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-01-09 21:33:13,202 INFO L175 Difference]: Start difference. First operand has 439 places, 438 transitions, 899 flow. Second operand 3 states and 1373 transitions. [2025-01-09 21:33:13,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 437 transitions, 951 flow [2025-01-09 21:33:13,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 437 transitions, 949 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:13,207 INFO L231 Difference]: Finished difference. Result has 439 places, 437 transitions, 899 flow [2025-01-09 21:33:13,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=439, PETRI_TRANSITIONS=437} [2025-01-09 21:33:13,208 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -155 predicate places. [2025-01-09 21:33:13,208 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 437 transitions, 899 flow [2025-01-09 21:33:13,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:13,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:13,209 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] [2025-01-09 21:33:13,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:33:13,209 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:13,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:13,209 INFO L85 PathProgramCache]: Analyzing trace with hash 392852350, now seen corresponding path program 1 times [2025-01-09 21:33:13,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:13,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230508388] [2025-01-09 21:33:13,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:13,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:13,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:33:13,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:33:13,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:13,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:13,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:13,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230508388] [2025-01-09 21:33:13,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230508388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:13,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:13,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:13,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390566559] [2025-01-09 21:33:13,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:13,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:13,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:13,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:13,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:13,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-01-09 21:33:13,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 437 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:13,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:13,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-01-09 21:33:13,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:13,929 INFO L124 PetriNetUnfolderBase]: 1272/3814 cut-off events. [2025-01-09 21:33:13,929 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2025-01-09 21:33:13,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5891 conditions, 3814 events. 1272/3814 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 29243 event pairs, 821 based on Foata normal form. 0/3501 useless extension candidates. Maximal degree in co-relation 5823. Up to 1713 conditions per place. [2025-01-09 21:33:13,950 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 26 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-01-09 21:33:13,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 436 transitions, 953 flow [2025-01-09 21:33:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-01-09 21:33:13,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-01-09 21:33:13,953 INFO L175 Difference]: Start difference. First operand has 439 places, 437 transitions, 899 flow. Second operand 3 states and 1371 transitions. [2025-01-09 21:33:13,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 436 transitions, 953 flow [2025-01-09 21:33:13,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 436 transitions, 949 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:13,957 INFO L231 Difference]: Finished difference. Result has 438 places, 436 transitions, 897 flow [2025-01-09 21:33:13,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=438, PETRI_TRANSITIONS=436} [2025-01-09 21:33:13,958 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -156 predicate places. [2025-01-09 21:33:13,958 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 436 transitions, 897 flow [2025-01-09 21:33:13,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:13,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:13,959 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] [2025-01-09 21:33:13,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:33:13,959 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:13,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1267526725, now seen corresponding path program 1 times [2025-01-09 21:33:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:13,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187445016] [2025-01-09 21:33:13,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:13,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 21:33:13,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 21:33:13,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:13,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:13,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:13,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187445016] [2025-01-09 21:33:13,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187445016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:13,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:13,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:13,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236557428] [2025-01-09 21:33:13,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:13,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:13,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:13,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:13,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:13,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-01-09 21:33:13,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 436 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:13,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:13,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-01-09 21:33:13,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:14,488 INFO L124 PetriNetUnfolderBase]: 1272/3813 cut-off events. [2025-01-09 21:33:14,491 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2025-01-09 21:33:14,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5887 conditions, 3813 events. 1272/3813 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 29289 event pairs, 821 based on Foata normal form. 0/3501 useless extension candidates. Maximal degree in co-relation 5820. Up to 1710 conditions per place. [2025-01-09 21:33:14,516 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 24 selfloop transitions, 1 changer transitions 0/435 dead transitions. [2025-01-09 21:33:14,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 435 transitions, 945 flow [2025-01-09 21:33:14,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2025-01-09 21:33:14,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395498392282959 [2025-01-09 21:33:14,519 INFO L175 Difference]: Start difference. First operand has 438 places, 436 transitions, 897 flow. Second operand 3 states and 1380 transitions. [2025-01-09 21:33:14,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 435 transitions, 945 flow [2025-01-09 21:33:14,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 435 transitions, 941 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:14,525 INFO L231 Difference]: Finished difference. Result has 437 places, 435 transitions, 893 flow [2025-01-09 21:33:14,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=437, PETRI_TRANSITIONS=435} [2025-01-09 21:33:14,527 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -157 predicate places. [2025-01-09 21:33:14,527 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 435 transitions, 893 flow [2025-01-09 21:33:14,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:14,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:14,528 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] [2025-01-09 21:33:14,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:33:14,528 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:14,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:14,529 INFO L85 PathProgramCache]: Analyzing trace with hash 162928457, now seen corresponding path program 1 times [2025-01-09 21:33:14,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:14,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522829561] [2025-01-09 21:33:14,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:14,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:14,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 21:33:14,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 21:33:14,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:14,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:14,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:14,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522829561] [2025-01-09 21:33:14,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522829561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:14,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:14,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:14,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074770927] [2025-01-09 21:33:14,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:14,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:14,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:14,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:14,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:14,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-01-09 21:33:14,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 435 transitions, 893 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:14,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:14,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-01-09 21:33:14,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:15,156 INFO L124 PetriNetUnfolderBase]: 1272/3812 cut-off events. [2025-01-09 21:33:15,156 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2025-01-09 21:33:15,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5887 conditions, 3812 events. 1272/3812 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 29288 event pairs, 821 based on Foata normal form. 0/3501 useless extension candidates. Maximal degree in co-relation 5819. Up to 1712 conditions per place. [2025-01-09 21:33:15,173 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-01-09 21:33:15,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 434 transitions, 945 flow [2025-01-09 21:33:15,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-01-09 21:33:15,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-01-09 21:33:15,175 INFO L175 Difference]: Start difference. First operand has 437 places, 435 transitions, 893 flow. Second operand 3 states and 1373 transitions. [2025-01-09 21:33:15,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 434 transitions, 945 flow [2025-01-09 21:33:15,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 434 transitions, 944 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:15,180 INFO L231 Difference]: Finished difference. Result has 437 places, 434 transitions, 894 flow [2025-01-09 21:33:15,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=437, PETRI_TRANSITIONS=434} [2025-01-09 21:33:15,181 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -157 predicate places. [2025-01-09 21:33:15,181 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 434 transitions, 894 flow [2025-01-09 21:33:15,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:15,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:15,182 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] [2025-01-09 21:33:15,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:33:15,182 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:15,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1178267006, now seen corresponding path program 1 times [2025-01-09 21:33:15,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:15,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351618737] [2025-01-09 21:33:15,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:15,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:15,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:33:15,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:33:15,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:15,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:15,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:15,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351618737] [2025-01-09 21:33:15,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351618737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:15,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:15,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:15,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678824327] [2025-01-09 21:33:15,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:15,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:15,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:15,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:15,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:15,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-01-09 21:33:15,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 434 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:15,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:15,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-01-09 21:33:15,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:15,776 INFO L124 PetriNetUnfolderBase]: 1272/3811 cut-off events. [2025-01-09 21:33:15,776 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2025-01-09 21:33:15,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5889 conditions, 3811 events. 1272/3811 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 29273 event pairs, 821 based on Foata normal form. 0/3501 useless extension candidates. Maximal degree in co-relation 5821. Up to 1713 conditions per place. [2025-01-09 21:33:15,798 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 26 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-01-09 21:33:15,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 433 transitions, 948 flow [2025-01-09 21:33:15,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-01-09 21:33:15,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-01-09 21:33:15,800 INFO L175 Difference]: Start difference. First operand has 437 places, 434 transitions, 894 flow. Second operand 3 states and 1371 transitions. [2025-01-09 21:33:15,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 433 transitions, 948 flow [2025-01-09 21:33:15,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 433 transitions, 944 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:15,805 INFO L231 Difference]: Finished difference. Result has 436 places, 433 transitions, 892 flow [2025-01-09 21:33:15,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=892, PETRI_PLACES=436, PETRI_TRANSITIONS=433} [2025-01-09 21:33:15,806 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -158 predicate places. [2025-01-09 21:33:15,806 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 433 transitions, 892 flow [2025-01-09 21:33:15,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:15,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:15,807 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] [2025-01-09 21:33:15,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:33:15,807 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:15,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:15,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1523922940, now seen corresponding path program 1 times [2025-01-09 21:33:15,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:15,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541248850] [2025-01-09 21:33:15,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:15,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:15,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:33:15,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:33:15,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:15,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:15,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:15,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541248850] [2025-01-09 21:33:15,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541248850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:15,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:15,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:15,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859938112] [2025-01-09 21:33:15,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:15,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:15,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:15,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:15,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:15,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-01-09 21:33:15,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 433 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:15,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:15,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-01-09 21:33:15,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:16,432 INFO L124 PetriNetUnfolderBase]: 1337/3825 cut-off events. [2025-01-09 21:33:16,432 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2025-01-09 21:33:16,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6038 conditions, 3825 events. 1337/3825 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 28561 event pairs, 224 based on Foata normal form. 0/3571 useless extension candidates. Maximal degree in co-relation 5971. Up to 1310 conditions per place. [2025-01-09 21:33:16,453 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 42 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-01-09 21:33:16,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 451 transitions, 1030 flow [2025-01-09 21:33:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1397 transitions. [2025-01-09 21:33:16,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7486602357984995 [2025-01-09 21:33:16,455 INFO L175 Difference]: Start difference. First operand has 436 places, 433 transitions, 892 flow. Second operand 3 states and 1397 transitions. [2025-01-09 21:33:16,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 451 transitions, 1030 flow [2025-01-09 21:33:16,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 451 transitions, 1026 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:16,460 INFO L231 Difference]: Finished difference. Result has 436 places, 433 transitions, 896 flow [2025-01-09 21:33:16,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=436, PETRI_TRANSITIONS=433} [2025-01-09 21:33:16,461 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -158 predicate places. [2025-01-09 21:33:16,461 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 433 transitions, 896 flow [2025-01-09 21:33:16,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:16,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:33:16,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:33:16,462 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:16,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash 60897759, now seen corresponding path program 1 times [2025-01-09 21:33:16,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:16,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684237909] [2025-01-09 21:33:16,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:16,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:16,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 21:33:16,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:33:16,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:16,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:16,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:16,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684237909] [2025-01-09 21:33:16,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684237909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:16,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:16,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149467409] [2025-01-09 21:33:16,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:16,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:16,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:16,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:16,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:16,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-01-09 21:33:16,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 433 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:16,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:16,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-01-09 21:33:16,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:17,095 INFO L124 PetriNetUnfolderBase]: 1316/3979 cut-off events. [2025-01-09 21:33:17,095 INFO L125 PetriNetUnfolderBase]: For 582/582 co-relation queries the response was YES. [2025-01-09 21:33:17,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6561 conditions, 3979 events. 1316/3979 cut-off events. For 582/582 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 30832 event pairs, 865 based on Foata normal form. 0/3661 useless extension candidates. Maximal degree in co-relation 6492. Up to 1794 conditions per place. [2025-01-09 21:33:17,112 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 26 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2025-01-09 21:33:17,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 432 transitions, 950 flow [2025-01-09 21:33:17,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-01-09 21:33:17,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-01-09 21:33:17,114 INFO L175 Difference]: Start difference. First operand has 436 places, 433 transitions, 896 flow. Second operand 3 states and 1373 transitions. [2025-01-09 21:33:17,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 432 transitions, 950 flow [2025-01-09 21:33:17,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 432 transitions, 948 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:17,119 INFO L231 Difference]: Finished difference. Result has 436 places, 432 transitions, 896 flow [2025-01-09 21:33:17,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=436, PETRI_TRANSITIONS=432} [2025-01-09 21:33:17,119 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -158 predicate places. [2025-01-09 21:33:17,120 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 432 transitions, 896 flow [2025-01-09 21:33:17,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:17,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:17,120 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] [2025-01-09 21:33:17,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:33:17,120 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:17,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:17,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1718650768, now seen corresponding path program 1 times [2025-01-09 21:33:17,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:17,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525627557] [2025-01-09 21:33:17,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:17,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:17,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:33:17,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:33:17,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:17,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:17,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:17,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525627557] [2025-01-09 21:33:17,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525627557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:17,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:17,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:17,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934471874] [2025-01-09 21:33:17,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:17,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:17,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:17,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:17,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:17,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-01-09 21:33:17,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 432 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:17,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:17,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-01-09 21:33:17,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:17,775 INFO L124 PetriNetUnfolderBase]: 1316/3978 cut-off events. [2025-01-09 21:33:17,775 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2025-01-09 21:33:17,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6429 conditions, 3978 events. 1316/3978 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 30869 event pairs, 865 based on Foata normal form. 0/3661 useless extension candidates. Maximal degree in co-relation 6360. Up to 1795 conditions per place. [2025-01-09 21:33:17,797 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/431 dead transitions. [2025-01-09 21:33:17,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 431 transitions, 952 flow [2025-01-09 21:33:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-01-09 21:33:17,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-01-09 21:33:17,799 INFO L175 Difference]: Start difference. First operand has 436 places, 432 transitions, 896 flow. Second operand 3 states and 1371 transitions. [2025-01-09 21:33:17,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 431 transitions, 952 flow [2025-01-09 21:33:17,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 431 transitions, 948 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:17,804 INFO L231 Difference]: Finished difference. Result has 435 places, 431 transitions, 894 flow [2025-01-09 21:33:17,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=435, PETRI_TRANSITIONS=431} [2025-01-09 21:33:17,805 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -159 predicate places. [2025-01-09 21:33:17,805 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 431 transitions, 894 flow [2025-01-09 21:33:17,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:17,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:17,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:17,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:33:17,806 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:17,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:17,807 INFO L85 PathProgramCache]: Analyzing trace with hash -516654652, now seen corresponding path program 1 times [2025-01-09 21:33:17,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:17,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575237788] [2025-01-09 21:33:17,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:17,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:17,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 21:33:17,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 21:33:17,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:17,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:17,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:17,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575237788] [2025-01-09 21:33:17,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575237788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:17,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:17,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:17,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50940800] [2025-01-09 21:33:17,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:17,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:17,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:17,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:17,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:17,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-01-09 21:33:17,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 431 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:17,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:17,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-01-09 21:33:17,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:18,405 INFO L124 PetriNetUnfolderBase]: 1316/3977 cut-off events. [2025-01-09 21:33:18,405 INFO L125 PetriNetUnfolderBase]: For 582/582 co-relation queries the response was YES. [2025-01-09 21:33:18,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6425 conditions, 3977 events. 1316/3977 cut-off events. For 582/582 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 30822 event pairs, 865 based on Foata normal form. 0/3661 useless extension candidates. Maximal degree in co-relation 6357. Up to 1792 conditions per place. [2025-01-09 21:33:18,427 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 25 selfloop transitions, 1 changer transitions 0/430 dead transitions. [2025-01-09 21:33:18,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 430 transitions, 944 flow [2025-01-09 21:33:18,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2025-01-09 21:33:18,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395498392282959 [2025-01-09 21:33:18,429 INFO L175 Difference]: Start difference. First operand has 435 places, 431 transitions, 894 flow. Second operand 3 states and 1380 transitions. [2025-01-09 21:33:18,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 430 transitions, 944 flow [2025-01-09 21:33:18,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 430 transitions, 940 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:18,441 INFO L231 Difference]: Finished difference. Result has 434 places, 430 transitions, 890 flow [2025-01-09 21:33:18,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=890, PETRI_PLACES=434, PETRI_TRANSITIONS=430} [2025-01-09 21:33:18,442 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -160 predicate places. [2025-01-09 21:33:18,442 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 430 transitions, 890 flow [2025-01-09 21:33:18,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:18,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:18,447 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] [2025-01-09 21:33:18,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:33:18,447 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:18,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:18,447 INFO L85 PathProgramCache]: Analyzing trace with hash 34747665, now seen corresponding path program 1 times [2025-01-09 21:33:18,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:18,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200607082] [2025-01-09 21:33:18,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:18,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:18,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 21:33:18,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 21:33:18,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:18,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:18,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:18,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200607082] [2025-01-09 21:33:18,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200607082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:18,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:18,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:18,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906545232] [2025-01-09 21:33:18,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:18,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:18,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:18,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:18,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:18,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-01-09 21:33:18,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 430 transitions, 890 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:18,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:18,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-01-09 21:33:18,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:19,348 INFO L124 PetriNetUnfolderBase]: 1316/3976 cut-off events. [2025-01-09 21:33:19,349 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2025-01-09 21:33:19,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6425 conditions, 3976 events. 1316/3976 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 30789 event pairs, 865 based on Foata normal form. 0/3661 useless extension candidates. Maximal degree in co-relation 6356. Up to 1794 conditions per place. [2025-01-09 21:33:19,372 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 26 selfloop transitions, 2 changer transitions 0/429 dead transitions. [2025-01-09 21:33:19,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 429 transitions, 944 flow [2025-01-09 21:33:19,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-01-09 21:33:19,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-01-09 21:33:19,375 INFO L175 Difference]: Start difference. First operand has 434 places, 430 transitions, 890 flow. Second operand 3 states and 1373 transitions. [2025-01-09 21:33:19,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 429 transitions, 944 flow [2025-01-09 21:33:19,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 429 transitions, 943 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:19,387 INFO L231 Difference]: Finished difference. Result has 434 places, 429 transitions, 891 flow [2025-01-09 21:33:19,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=434, PETRI_TRANSITIONS=429} [2025-01-09 21:33:19,388 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -160 predicate places. [2025-01-09 21:33:19,388 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 429 transitions, 891 flow [2025-01-09 21:33:19,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:19,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:19,389 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] [2025-01-09 21:33:19,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:33:19,389 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:19,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:19,390 INFO L85 PathProgramCache]: Analyzing trace with hash 506086673, now seen corresponding path program 1 times [2025-01-09 21:33:19,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:19,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578005681] [2025-01-09 21:33:19,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:19,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:19,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 21:33:19,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 21:33:19,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:19,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:19,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:19,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578005681] [2025-01-09 21:33:19,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578005681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:19,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:19,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:19,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909015180] [2025-01-09 21:33:19,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:19,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:19,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:19,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:19,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:19,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-01-09 21:33:19,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 429 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:19,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:19,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-01-09 21:33:19,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:20,436 INFO L124 PetriNetUnfolderBase]: 1316/3975 cut-off events. [2025-01-09 21:33:20,437 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2025-01-09 21:33:20,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6427 conditions, 3975 events. 1316/3975 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 30843 event pairs, 865 based on Foata normal form. 0/3661 useless extension candidates. Maximal degree in co-relation 6358. Up to 1795 conditions per place. [2025-01-09 21:33:20,464 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2025-01-09 21:33:20,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 428 transitions, 947 flow [2025-01-09 21:33:20,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-01-09 21:33:20,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-01-09 21:33:20,466 INFO L175 Difference]: Start difference. First operand has 434 places, 429 transitions, 891 flow. Second operand 3 states and 1371 transitions. [2025-01-09 21:33:20,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 428 transitions, 947 flow [2025-01-09 21:33:20,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 428 transitions, 943 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:20,472 INFO L231 Difference]: Finished difference. Result has 433 places, 428 transitions, 889 flow [2025-01-09 21:33:20,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=889, PETRI_PLACES=433, PETRI_TRANSITIONS=428} [2025-01-09 21:33:20,473 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -161 predicate places. [2025-01-09 21:33:20,473 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 428 transitions, 889 flow [2025-01-09 21:33:20,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:20,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:20,474 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] [2025-01-09 21:33:20,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:33:20,474 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:20,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:20,475 INFO L85 PathProgramCache]: Analyzing trace with hash -865242514, now seen corresponding path program 1 times [2025-01-09 21:33:20,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:20,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49244419] [2025-01-09 21:33:20,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:20,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:20,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 21:33:20,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 21:33:20,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:20,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:20,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:20,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49244419] [2025-01-09 21:33:20,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49244419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:20,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:20,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:20,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304721035] [2025-01-09 21:33:20,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:20,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:20,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:20,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:20,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:20,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-01-09 21:33:20,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 428 transitions, 889 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:20,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:20,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-01-09 21:33:20,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:21,137 INFO L124 PetriNetUnfolderBase]: 1343/4178 cut-off events. [2025-01-09 21:33:21,137 INFO L125 PetriNetUnfolderBase]: For 669/669 co-relation queries the response was YES. [2025-01-09 21:33:21,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6709 conditions, 4178 events. 1343/4178 cut-off events. For 669/669 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 32730 event pairs, 236 based on Foata normal form. 0/3879 useless extension candidates. Maximal degree in co-relation 6641. Up to 1315 conditions per place. [2025-01-09 21:33:21,156 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 43 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2025-01-09 21:33:21,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 446 transitions, 1032 flow [2025-01-09 21:33:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2025-01-09 21:33:21,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7481243301178992 [2025-01-09 21:33:21,159 INFO L175 Difference]: Start difference. First operand has 433 places, 428 transitions, 889 flow. Second operand 3 states and 1396 transitions. [2025-01-09 21:33:21,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 446 transitions, 1032 flow [2025-01-09 21:33:21,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 446 transitions, 1028 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:21,163 INFO L231 Difference]: Finished difference. Result has 433 places, 428 transitions, 893 flow [2025-01-09 21:33:21,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=433, PETRI_TRANSITIONS=428} [2025-01-09 21:33:21,164 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -161 predicate places. [2025-01-09 21:33:21,164 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 428 transitions, 893 flow [2025-01-09 21:33:21,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:21,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:21,165 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] [2025-01-09 21:33:21,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:33:21,165 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:21,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:21,166 INFO L85 PathProgramCache]: Analyzing trace with hash 553979069, now seen corresponding path program 1 times [2025-01-09 21:33:21,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:21,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578818888] [2025-01-09 21:33:21,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:21,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:21,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 21:33:21,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 21:33:21,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:21,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:21,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:21,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578818888] [2025-01-09 21:33:21,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578818888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:21,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:21,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:21,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367393370] [2025-01-09 21:33:21,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:21,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:21,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:21,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:21,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:21,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-01-09 21:33:21,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 428 transitions, 893 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:21,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:21,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-01-09 21:33:21,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:21,823 INFO L124 PetriNetUnfolderBase]: 1343/4137 cut-off events. [2025-01-09 21:33:21,823 INFO L125 PetriNetUnfolderBase]: For 885/885 co-relation queries the response was YES. [2025-01-09 21:33:21,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7105 conditions, 4137 events. 1343/4137 cut-off events. For 885/885 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 32696 event pairs, 908 based on Foata normal form. 0/3814 useless extension candidates. Maximal degree in co-relation 7035. Up to 1854 conditions per place. [2025-01-09 21:33:21,851 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/427 dead transitions. [2025-01-09 21:33:21,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 427 transitions, 949 flow [2025-01-09 21:33:21,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-01-09 21:33:21,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-01-09 21:33:21,854 INFO L175 Difference]: Start difference. First operand has 433 places, 428 transitions, 893 flow. Second operand 3 states and 1373 transitions. [2025-01-09 21:33:21,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 427 transitions, 949 flow [2025-01-09 21:33:21,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 427 transitions, 947 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:21,859 INFO L231 Difference]: Finished difference. Result has 433 places, 427 transitions, 893 flow [2025-01-09 21:33:21,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=433, PETRI_TRANSITIONS=427} [2025-01-09 21:33:21,860 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -161 predicate places. [2025-01-09 21:33:21,860 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 427 transitions, 893 flow [2025-01-09 21:33:21,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:21,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:21,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:21,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:33:21,861 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:21,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:21,862 INFO L85 PathProgramCache]: Analyzing trace with hash 242225335, now seen corresponding path program 1 times [2025-01-09 21:33:21,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:21,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560709969] [2025-01-09 21:33:21,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:21,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:21,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 21:33:21,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 21:33:21,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:21,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:21,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:21,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560709969] [2025-01-09 21:33:21,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560709969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:21,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:21,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:21,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784159570] [2025-01-09 21:33:21,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:21,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:21,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:21,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:21,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:21,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-01-09 21:33:21,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 427 transitions, 893 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:21,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:21,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-01-09 21:33:21,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:22,594 INFO L124 PetriNetUnfolderBase]: 1343/4136 cut-off events. [2025-01-09 21:33:22,594 INFO L125 PetriNetUnfolderBase]: For 884/884 co-relation queries the response was YES. [2025-01-09 21:33:22,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6962 conditions, 4136 events. 1343/4136 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 32684 event pairs, 908 based on Foata normal form. 0/3814 useless extension candidates. Maximal degree in co-relation 6892. Up to 1855 conditions per place. [2025-01-09 21:33:22,615 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 28 selfloop transitions, 2 changer transitions 0/426 dead transitions. [2025-01-09 21:33:22,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 426 transitions, 951 flow [2025-01-09 21:33:22,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-01-09 21:33:22,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-01-09 21:33:22,618 INFO L175 Difference]: Start difference. First operand has 433 places, 427 transitions, 893 flow. Second operand 3 states and 1371 transitions. [2025-01-09 21:33:22,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 426 transitions, 951 flow [2025-01-09 21:33:22,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 426 transitions, 947 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:22,623 INFO L231 Difference]: Finished difference. Result has 432 places, 426 transitions, 891 flow [2025-01-09 21:33:22,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=432, PETRI_TRANSITIONS=426} [2025-01-09 21:33:22,624 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -162 predicate places. [2025-01-09 21:33:22,624 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 426 transitions, 891 flow [2025-01-09 21:33:22,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-01-09 21:33:22,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:22,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:22,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:33:22,625 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:22,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1217012839, now seen corresponding path program 1 times [2025-01-09 21:33:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:22,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926705614] [2025-01-09 21:33:22,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:22,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:22,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 21:33:22,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 21:33:22,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:22,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:22,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:22,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926705614] [2025-01-09 21:33:22,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926705614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:22,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:22,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:22,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707721453] [2025-01-09 21:33:22,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:22,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:22,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:22,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:22,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:22,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-01-09 21:33:22,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 426 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:22,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:22,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-01-09 21:33:22,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:23,357 INFO L124 PetriNetUnfolderBase]: 1343/4135 cut-off events. [2025-01-09 21:33:23,357 INFO L125 PetriNetUnfolderBase]: For 885/885 co-relation queries the response was YES. [2025-01-09 21:33:23,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6958 conditions, 4135 events. 1343/4135 cut-off events. For 885/885 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 32683 event pairs, 908 based on Foata normal form. 0/3814 useless extension candidates. Maximal degree in co-relation 6889. Up to 1852 conditions per place. [2025-01-09 21:33:23,388 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 26 selfloop transitions, 1 changer transitions 0/425 dead transitions. [2025-01-09 21:33:23,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 425 transitions, 943 flow [2025-01-09 21:33:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2025-01-09 21:33:23,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395498392282959 [2025-01-09 21:33:23,390 INFO L175 Difference]: Start difference. First operand has 432 places, 426 transitions, 891 flow. Second operand 3 states and 1380 transitions. [2025-01-09 21:33:23,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 425 transitions, 943 flow [2025-01-09 21:33:23,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 425 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:23,396 INFO L231 Difference]: Finished difference. Result has 431 places, 425 transitions, 887 flow [2025-01-09 21:33:23,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=887, PETRI_PLACES=431, PETRI_TRANSITIONS=425} [2025-01-09 21:33:23,397 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -163 predicate places. [2025-01-09 21:33:23,397 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 425 transitions, 887 flow [2025-01-09 21:33:23,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-01-09 21:33:23,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:23,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:23,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:33:23,398 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:23,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1145895230, now seen corresponding path program 1 times [2025-01-09 21:33:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:23,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914283941] [2025-01-09 21:33:23,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:23,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-09 21:33:23,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-09 21:33:23,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:23,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:23,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:23,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914283941] [2025-01-09 21:33:23,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914283941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:23,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:23,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:23,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548067088] [2025-01-09 21:33:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:23,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:23,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:23,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:23,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:23,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-01-09 21:33:23,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 425 transitions, 887 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:23,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:23,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-01-09 21:33:23,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:24,113 INFO L124 PetriNetUnfolderBase]: 1343/4134 cut-off events. [2025-01-09 21:33:24,113 INFO L125 PetriNetUnfolderBase]: For 884/884 co-relation queries the response was YES. [2025-01-09 21:33:24,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6958 conditions, 4134 events. 1343/4134 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 32679 event pairs, 908 based on Foata normal form. 0/3814 useless extension candidates. Maximal degree in co-relation 6888. Up to 1854 conditions per place. [2025-01-09 21:33:24,134 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/424 dead transitions. [2025-01-09 21:33:24,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 424 transitions, 943 flow [2025-01-09 21:33:24,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-01-09 21:33:24,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-01-09 21:33:24,136 INFO L175 Difference]: Start difference. First operand has 431 places, 425 transitions, 887 flow. Second operand 3 states and 1373 transitions. [2025-01-09 21:33:24,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 424 transitions, 943 flow [2025-01-09 21:33:24,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 424 transitions, 942 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:24,141 INFO L231 Difference]: Finished difference. Result has 431 places, 424 transitions, 888 flow [2025-01-09 21:33:24,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=431, PETRI_TRANSITIONS=424} [2025-01-09 21:33:24,142 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -163 predicate places. [2025-01-09 21:33:24,142 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 424 transitions, 888 flow [2025-01-09 21:33:24,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:24,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:24,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:33:24,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:33:24,143 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:24,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1542166715, now seen corresponding path program 1 times [2025-01-09 21:33:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:24,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147401793] [2025-01-09 21:33:24,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:24,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:24,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 21:33:24,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 21:33:24,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:24,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:24,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:24,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147401793] [2025-01-09 21:33:24,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147401793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:24,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:24,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:24,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115920160] [2025-01-09 21:33:24,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:24,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:24,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:24,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:24,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:24,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-01-09 21:33:24,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 424 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:24,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:24,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-01-09 21:33:24,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:24,828 INFO L124 PetriNetUnfolderBase]: 1343/4133 cut-off events. [2025-01-09 21:33:24,828 INFO L125 PetriNetUnfolderBase]: For 884/884 co-relation queries the response was YES. [2025-01-09 21:33:24,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6959 conditions, 4133 events. 1343/4133 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 32682 event pairs, 908 based on Foata normal form. 0/3814 useless extension candidates. Maximal degree in co-relation 6889. Up to 1854 conditions per place. [2025-01-09 21:33:24,853 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2025-01-09 21:33:24,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 423 transitions, 944 flow [2025-01-09 21:33:24,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-01-09 21:33:24,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-01-09 21:33:24,856 INFO L175 Difference]: Start difference. First operand has 431 places, 424 transitions, 888 flow. Second operand 3 states and 1373 transitions. [2025-01-09 21:33:24,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 423 transitions, 944 flow [2025-01-09 21:33:24,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 423 transitions, 940 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:24,861 INFO L231 Difference]: Finished difference. Result has 430 places, 423 transitions, 886 flow [2025-01-09 21:33:24,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=430, PETRI_TRANSITIONS=423} [2025-01-09 21:33:24,862 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -164 predicate places. [2025-01-09 21:33:24,862 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 423 transitions, 886 flow [2025-01-09 21:33:24,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:24,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:24,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:33:24,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:33:24,863 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:24,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:24,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1270349231, now seen corresponding path program 1 times [2025-01-09 21:33:24,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:24,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982481743] [2025-01-09 21:33:24,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:24,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:24,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-09 21:33:24,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-09 21:33:24,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:24,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:24,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:24,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982481743] [2025-01-09 21:33:24,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982481743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:24,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:24,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:24,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959164282] [2025-01-09 21:33:24,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:24,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:24,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:24,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:24,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:24,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-01-09 21:33:24,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 423 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:24,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:24,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-01-09 21:33:24,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:25,534 INFO L124 PetriNetUnfolderBase]: 1343/4132 cut-off events. [2025-01-09 21:33:25,534 INFO L125 PetriNetUnfolderBase]: For 884/884 co-relation queries the response was YES. [2025-01-09 21:33:25,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6958 conditions, 4132 events. 1343/4132 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 32614 event pairs, 908 based on Foata normal form. 0/3814 useless extension candidates. Maximal degree in co-relation 6888. Up to 1854 conditions per place. [2025-01-09 21:33:25,550 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-01-09 21:33:25,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 422 transitions, 942 flow [2025-01-09 21:33:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-01-09 21:33:25,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-01-09 21:33:25,552 INFO L175 Difference]: Start difference. First operand has 430 places, 423 transitions, 886 flow. Second operand 3 states and 1373 transitions. [2025-01-09 21:33:25,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 422 transitions, 942 flow [2025-01-09 21:33:25,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 422 transitions, 938 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:25,557 INFO L231 Difference]: Finished difference. Result has 429 places, 422 transitions, 884 flow [2025-01-09 21:33:25,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=429, PETRI_TRANSITIONS=422} [2025-01-09 21:33:25,557 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -165 predicate places. [2025-01-09 21:33:25,557 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 422 transitions, 884 flow [2025-01-09 21:33:25,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-01-09 21:33:25,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:25,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:33:25,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:33:25,558 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-01-09 21:33:25,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:25,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1866147707, now seen corresponding path program 1 times [2025-01-09 21:33:25,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:25,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721253368] [2025-01-09 21:33:25,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:25,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:25,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-01-09 21:33:25,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-01-09 21:33:25,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:25,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:25,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:25,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721253368] [2025-01-09 21:33:25,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721253368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:25,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:25,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:25,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461970887] [2025-01-09 21:33:25,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:25,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:25,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:25,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:25,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:25,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-01-09 21:33:25,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 422 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 455.6666666666667) internal successors, (1367), 3 states have internal predecessors, (1367), 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-01-09 21:33:25,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:25,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-01-09 21:33:25,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:26,223 INFO L124 PetriNetUnfolderBase]: 1343/4116 cut-off events. [2025-01-09 21:33:26,224 INFO L125 PetriNetUnfolderBase]: For 884/884 co-relation queries the response was YES. [2025-01-09 21:33:26,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6954 conditions, 4116 events. 1343/4116 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 32610 event pairs, 908 based on Foata normal form. 16/3814 useless extension candidates. Maximal degree in co-relation 6884. Up to 1852 conditions per place. [2025-01-09 21:33:26,242 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 0 selfloop transitions, 0 changer transitions 421/421 dead transitions. [2025-01-09 21:33:26,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 421 transitions, 934 flow [2025-01-09 21:33:26,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1379 transitions. [2025-01-09 21:33:26,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7390139335476956 [2025-01-09 21:33:26,244 INFO L175 Difference]: Start difference. First operand has 429 places, 422 transitions, 884 flow. Second operand 3 states and 1379 transitions. [2025-01-09 21:33:26,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 421 transitions, 934 flow [2025-01-09 21:33:26,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 421 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:26,249 INFO L231 Difference]: Finished difference. Result has 428 places, 0 transitions, 0 flow [2025-01-09 21:33:26,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=428, PETRI_TRANSITIONS=0} [2025-01-09 21:33:26,251 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -166 predicate places. [2025-01-09 21:33:26,251 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 0 transitions, 0 flow [2025-01-09 21:33:26,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.6666666666667) internal successors, (1367), 3 states have internal predecessors, (1367), 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-01-09 21:33:26,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (299 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (298 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (297 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (296 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (295 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (294 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (293 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (292 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (291 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (290 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (289 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (288 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (287 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (286 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (285 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (284 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (283 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (282 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (281 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (280 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (279 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (278 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (277 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (276 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (275 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (274 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (273 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (272 of 300 remaining) [2025-01-09 21:33:26,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (271 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (270 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (269 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (268 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (267 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (266 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (265 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (264 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (263 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (262 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (261 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (260 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (259 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (258 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (257 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (256 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (255 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (254 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (253 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (252 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (251 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (250 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (249 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (248 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (247 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (246 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (245 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (244 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (243 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (242 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (241 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (240 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (239 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (238 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (237 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (236 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (235 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (234 of 300 remaining) [2025-01-09 21:33:26,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (233 of 300 remaining) [2025-01-09 21:33:26,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (232 of 300 remaining) [2025-01-09 21:33:26,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (231 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (230 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (229 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (228 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (227 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (226 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (225 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (224 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (223 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (222 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (221 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (220 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (219 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (218 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (217 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (216 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (215 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (214 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (213 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (212 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (211 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (210 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (209 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (208 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (207 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (206 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (205 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (204 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (203 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (202 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (201 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (200 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (199 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (198 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (197 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (196 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (195 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (194 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (193 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (192 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (191 of 300 remaining) [2025-01-09 21:33:26,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (190 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (189 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (188 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (187 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (186 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (185 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (184 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (183 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (182 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (181 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (180 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (179 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (178 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (177 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (176 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (175 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (174 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (173 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (172 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (171 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (170 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (169 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (168 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (167 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (166 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (165 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (164 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (163 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (162 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (161 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (160 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (159 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (158 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (157 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (156 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (155 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (154 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (153 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (152 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (151 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (150 of 300 remaining) [2025-01-09 21:33:26,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (149 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (148 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (147 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (146 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (145 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (144 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (143 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (142 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (141 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (140 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (139 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (138 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (137 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (136 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (135 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (134 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (133 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (132 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (131 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (130 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (129 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (128 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (127 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (126 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (125 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (124 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (123 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (122 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (121 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (120 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (119 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (118 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (117 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (116 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (115 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (114 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (113 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (112 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (111 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (110 of 300 remaining) [2025-01-09 21:33:26,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (109 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (108 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (107 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (106 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (105 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (104 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (103 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (102 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (101 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (100 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (99 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (98 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (97 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (96 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (95 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (94 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (93 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (92 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (91 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (90 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (89 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (88 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (87 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (86 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (85 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (84 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (83 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (82 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (81 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (80 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (79 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (78 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (77 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (76 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (75 of 300 remaining) [2025-01-09 21:33:26,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (74 of 300 remaining) [2025-01-09 21:33:26,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (73 of 300 remaining) [2025-01-09 21:33:26,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (72 of 300 remaining) [2025-01-09 21:33:26,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (71 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (70 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (69 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (68 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (67 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (66 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (65 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (64 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (63 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (62 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (61 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (60 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (59 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (58 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (57 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (56 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (55 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (54 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (53 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (52 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (51 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (50 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (49 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (48 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (47 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (46 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (45 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (44 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (43 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (42 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (41 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (40 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (39 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (38 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (37 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (36 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (35 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (34 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (33 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (32 of 300 remaining) [2025-01-09 21:33:26,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (31 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (30 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (29 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (28 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (27 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (26 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (25 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (24 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (23 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (22 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (21 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (20 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (19 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (18 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (17 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (16 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (15 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (14 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (13 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (12 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (11 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (10 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (9 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (8 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (7 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (6 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (5 of 300 remaining) [2025-01-09 21:33:26,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (4 of 300 remaining) [2025-01-09 21:33:26,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (3 of 300 remaining) [2025-01-09 21:33:26,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (2 of 300 remaining) [2025-01-09 21:33:26,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (1 of 300 remaining) [2025-01-09 21:33:26,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (0 of 300 remaining) [2025-01-09 21:33:26,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:33:26,274 INFO L422 BasicCegarLoop]: Path program 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] [2025-01-09 21:33:26,278 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:26,279 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:26,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:26 BasicIcfg [2025-01-09 21:33:26,283 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:26,283 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:26,283 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:26,283 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:26,284 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:04" (3/4) ... [2025-01-09 21:33:26,285 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:26,287 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:26,287 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:26,287 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:26,287 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:33:26,292 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2025-01-09 21:33:26,293 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:26,293 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:33:26,293 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:26,353 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:26,354 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:26,354 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:26,354 INFO L158 Benchmark]: Toolchain (without parser) took 24147.56ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 115.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-01-09 21:33:26,355 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:26,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.17ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 98.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:26,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.77ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 94.0MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:26,355 INFO L158 Benchmark]: Boogie Preprocessor took 71.90ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 88.8MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:26,355 INFO L158 Benchmark]: RCFGBuilder took 2127.32ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 88.8MB in the beginning and 195.9MB in the end (delta: -107.1MB). Peak memory consumption was 184.2MB. Max. memory is 16.1GB. [2025-01-09 21:33:26,355 INFO L158 Benchmark]: TraceAbstraction took 21545.62ms. Allocated memory was 427.8MB in the beginning and 2.5GB in the end (delta: 2.1GB). Free memory was 195.9MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 786.3MB. Max. memory is 16.1GB. [2025-01-09 21:33:26,356 INFO L158 Benchmark]: Witness Printer took 70.76ms. Allocated memory is still 2.5GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:26,357 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.17ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 98.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.77ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 94.0MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.90ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 88.8MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2127.32ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 88.8MB in the beginning and 195.9MB in the end (delta: -107.1MB). Peak memory consumption was 184.2MB. Max. memory is 16.1GB. * TraceAbstraction took 21545.62ms. Allocated memory was 427.8MB in the beginning and 2.5GB in the end (delta: 2.1GB). Free memory was 195.9MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 786.3MB. Max. memory is 16.1GB. * Witness Printer took 70.76ms. Allocated memory is still 2.5GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 197]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 160]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 160]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 197]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 164]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 197]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 167]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 168]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 168]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 169]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 170]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 170]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 197]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 172]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 185]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 786 locations, 300 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.3s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 276 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1715 IncrementalHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 162 mSDtfsCounter, 1715 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1226occurred in iteration=0, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 4461 NumberOfCodeBlocks, 4461 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4432 ConstructedInterpolants, 0 QuantifiedInterpolants, 4603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 164 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:26,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE