./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-dec-subseq.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-more-dec-subseq.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 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:25,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:25,584 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:25,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:25,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:25,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:25,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:25,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:25,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:25,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:25,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:25,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:25,616 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:25,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:25,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:25,617 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:25,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:25,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:25,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:25,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:25,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:25,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:25,617 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:25,618 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:25,618 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:25,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:25,618 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:25,618 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:25,618 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:25,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:25,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:25,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:25,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:25,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:25,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:25,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:25,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:25,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:25,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:25,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:25,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:25,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:25,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:25,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:25,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:25,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:25,620 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 -> 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b [2025-01-09 21:33:25,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:25,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:25,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:25,868 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:25,868 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:25,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2025-01-09 21:33:27,170 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d08bcc4dc/e8a902e3ef6b45f8aa8d6b04b20ec1f3/FLAG6e7ea9f75 [2025-01-09 21:33:27,421 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:27,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2025-01-09 21:33:27,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d08bcc4dc/e8a902e3ef6b45f8aa8d6b04b20ec1f3/FLAG6e7ea9f75 [2025-01-09 21:33:27,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d08bcc4dc/e8a902e3ef6b45f8aa8d6b04b20ec1f3 [2025-01-09 21:33:27,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:27,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:27,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:27,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:27,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:27,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:27" (1/1) ... [2025-01-09 21:33:27,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311e5e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:27, skipping insertion in model container [2025-01-09 21:33:27,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:27" (1/1) ... [2025-01-09 21:33:27,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:27,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:27,627 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:27,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:27,657 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:27,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:27 WrapperNode [2025-01-09 21:33:27,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:27,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:27,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:27,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:27,663 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:27" (1/1) ... [2025-01-09 21:33:27,669 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:27" (1/1) ... [2025-01-09 21:33:27,692 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 12, calls inlined = 14, statements flattened = 397 [2025-01-09 21:33:27,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:27,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:27,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:27,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:27,698 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:27" (1/1) ... [2025-01-09 21:33:27,698 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:27" (1/1) ... [2025-01-09 21:33:27,702 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:27" (1/1) ... [2025-01-09 21:33:27,702 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:27" (1/1) ... [2025-01-09 21:33:27,710 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:27" (1/1) ... [2025-01-09 21:33:27,712 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:27" (1/1) ... [2025-01-09 21:33:27,715 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:27" (1/1) ... [2025-01-09 21:33:27,716 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:27" (1/1) ... [2025-01-09 21:33:27,717 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:27" (1/1) ... [2025-01-09 21:33:27,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:27,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:27,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:27,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:27,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:27" (1/1) ... [2025-01-09 21:33:27,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:27,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:27,757 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:27,763 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:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:27,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:27,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:33:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:33:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:27,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:27,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:27,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:27,780 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:27,847 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:27,848 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:28,275 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:28,275 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:28,522 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:28,522 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:33:28,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:28 BoogieIcfgContainer [2025-01-09 21:33:28,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:28,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:28,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:28,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:28,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:27" (1/3) ... [2025-01-09 21:33:28,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6eddab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:28, skipping insertion in model container [2025-01-09 21:33:28,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:27" (2/3) ... [2025-01-09 21:33:28,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6eddab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:28, skipping insertion in model container [2025-01-09 21:33:28,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:28" (3/3) ... [2025-01-09 21:33:28,529 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2025-01-09 21:33:28,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:28,542 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-dec-subseq.wvr.c that has 3 procedures, 358 locations, 1 initial locations, 4 loop locations, and 67 error locations. [2025-01-09 21:33:28,542 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:28,627 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:33:28,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 364 places, 370 transitions, 754 flow [2025-01-09 21:33:28,801 INFO L124 PetriNetUnfolderBase]: 13/368 cut-off events. [2025-01-09 21:33:28,807 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:33:28,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 368 events. 13/368 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 602 event pairs, 0 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 290. Up to 2 conditions per place. [2025-01-09 21:33:28,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 364 places, 370 transitions, 754 flow [2025-01-09 21:33:28,823 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 346 places, 351 transitions, 714 flow [2025-01-09 21:33:28,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:28,842 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;@4c884ce4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:28,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 117 error locations. [2025-01-09 21:33:28,847 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:28,847 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-01-09 21:33:28,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:28,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:28,848 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] [2025-01-09 21:33:28,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:28,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1028716587, now seen corresponding path program 1 times [2025-01-09 21:33:28,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:28,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133228821] [2025-01-09 21:33:28,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:28,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:28,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:33:28,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:33:28,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:28,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:28,959 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:28,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:28,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133228821] [2025-01-09 21:33:28,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133228821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:28,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:28,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676879512] [2025-01-09 21:33:28,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:28,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:28,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:28,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:28,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:29,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 370 [2025-01-09 21:33:29,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 351 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:29,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:29,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 370 [2025-01-09 21:33:29,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:29,114 INFO L124 PetriNetUnfolderBase]: 40/483 cut-off events. [2025-01-09 21:33:29,114 INFO L125 PetriNetUnfolderBase]: For 37/38 co-relation queries the response was YES. [2025-01-09 21:33:29,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 483 events. 40/483 cut-off events. For 37/38 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1354 event pairs, 13 based on Foata normal form. 16/401 useless extension candidates. Maximal degree in co-relation 278. Up to 61 conditions per place. [2025-01-09 21:33:29,119 INFO L140 encePairwiseOnDemand]: 329/370 looper letters, 15 selfloop transitions, 2 changer transitions 5/312 dead transitions. [2025-01-09 21:33:29,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 312 transitions, 670 flow [2025-01-09 21:33:29,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 989 transitions. [2025-01-09 21:33:29,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.890990990990991 [2025-01-09 21:33:29,132 INFO L175 Difference]: Start difference. First operand has 346 places, 351 transitions, 714 flow. Second operand 3 states and 989 transitions. [2025-01-09 21:33:29,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 312 transitions, 670 flow [2025-01-09 21:33:29,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 312 transitions, 662 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:33:29,142 INFO L231 Difference]: Finished difference. Result has 311 places, 307 transitions, 622 flow [2025-01-09 21:33:29,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=311, PETRI_TRANSITIONS=307} [2025-01-09 21:33:29,146 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -35 predicate places. [2025-01-09 21:33:29,146 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 307 transitions, 622 flow [2025-01-09 21:33:29,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:29,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:29,147 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] [2025-01-09 21:33:29,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:29,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:29,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1932522222, now seen corresponding path program 1 times [2025-01-09 21:33:29,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:29,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688718027] [2025-01-09 21:33:29,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:29,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:29,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:33:29,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:33:29,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:29,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:29,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:29,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:29,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688718027] [2025-01-09 21:33:29,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688718027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:29,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:29,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:29,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772747950] [2025-01-09 21:33:29,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:29,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:29,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:29,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:29,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:29,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 370 [2025-01-09 21:33:29,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 307 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:29,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:29,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 370 [2025-01-09 21:33:29,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:29,304 INFO L124 PetriNetUnfolderBase]: 26/481 cut-off events. [2025-01-09 21:33:29,304 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:29,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 481 events. 26/481 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1276 event pairs, 10 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 503. Up to 44 conditions per place. [2025-01-09 21:33:29,309 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 15 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2025-01-09 21:33:29,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 306 transitions, 654 flow [2025-01-09 21:33:29,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:29,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2025-01-09 21:33:29,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567567567567568 [2025-01-09 21:33:29,312 INFO L175 Difference]: Start difference. First operand has 311 places, 307 transitions, 622 flow. Second operand 3 states and 951 transitions. [2025-01-09 21:33:29,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 306 transitions, 654 flow [2025-01-09 21:33:29,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 306 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:29,319 INFO L231 Difference]: Finished difference. Result has 305 places, 306 transitions, 620 flow [2025-01-09 21:33:29,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=305, PETRI_TRANSITIONS=306} [2025-01-09 21:33:29,321 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -41 predicate places. [2025-01-09 21:33:29,321 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 306 transitions, 620 flow [2025-01-09 21:33:29,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:29,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:29,321 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] [2025-01-09 21:33:29,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:29,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:29,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:29,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1958467235, now seen corresponding path program 1 times [2025-01-09 21:33:29,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:29,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647554741] [2025-01-09 21:33:29,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:29,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:29,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:33:29,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:33:29,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:29,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:29,374 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:29,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:29,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647554741] [2025-01-09 21:33:29,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647554741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:29,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:29,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:29,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003600287] [2025-01-09 21:33:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:29,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:29,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:29,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:29,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:29,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 370 [2025-01-09 21:33:29,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 306 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:29,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:29,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 370 [2025-01-09 21:33:29,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:29,459 INFO L124 PetriNetUnfolderBase]: 28/464 cut-off events. [2025-01-09 21:33:29,459 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-01-09 21:33:29,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 464 events. 28/464 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1175 event pairs, 7 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 474. Up to 41 conditions per place. [2025-01-09 21:33:29,461 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 13 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2025-01-09 21:33:29,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 305 transitions, 648 flow [2025-01-09 21:33:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 955 transitions. [2025-01-09 21:33:29,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8603603603603603 [2025-01-09 21:33:29,464 INFO L175 Difference]: Start difference. First operand has 305 places, 306 transitions, 620 flow. Second operand 3 states and 955 transitions. [2025-01-09 21:33:29,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 305 transitions, 648 flow [2025-01-09 21:33:29,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 305 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:29,468 INFO L231 Difference]: Finished difference. Result has 304 places, 305 transitions, 618 flow [2025-01-09 21:33:29,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=304, PETRI_TRANSITIONS=305} [2025-01-09 21:33:29,469 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -42 predicate places. [2025-01-09 21:33:29,469 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 305 transitions, 618 flow [2025-01-09 21:33:29,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:29,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:29,470 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] [2025-01-09 21:33:29,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:29,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:29,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:29,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1410160051, now seen corresponding path program 1 times [2025-01-09 21:33:29,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:29,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798781953] [2025-01-09 21:33:29,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:29,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:29,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:33:29,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:33:29,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:29,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:29,505 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:29,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:29,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798781953] [2025-01-09 21:33:29,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798781953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:29,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:29,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:29,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435145265] [2025-01-09 21:33:29,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:29,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:29,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:29,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:29,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:29,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 370 [2025-01-09 21:33:29,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 305 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:29,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:29,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 370 [2025-01-09 21:33:29,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:29,590 INFO L124 PetriNetUnfolderBase]: 28/463 cut-off events. [2025-01-09 21:33:29,591 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-01-09 21:33:29,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 463 events. 28/463 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1179 event pairs, 7 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 465. Up to 41 conditions per place. [2025-01-09 21:33:29,593 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 13 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2025-01-09 21:33:29,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 304 transitions, 646 flow [2025-01-09 21:33:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 955 transitions. [2025-01-09 21:33:29,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8603603603603603 [2025-01-09 21:33:29,596 INFO L175 Difference]: Start difference. First operand has 304 places, 305 transitions, 618 flow. Second operand 3 states and 955 transitions. [2025-01-09 21:33:29,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 304 transitions, 646 flow [2025-01-09 21:33:29,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 304 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:29,600 INFO L231 Difference]: Finished difference. Result has 303 places, 304 transitions, 616 flow [2025-01-09 21:33:29,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=303, PETRI_TRANSITIONS=304} [2025-01-09 21:33:29,601 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -43 predicate places. [2025-01-09 21:33:29,601 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 304 transitions, 616 flow [2025-01-09 21:33:29,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:29,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:29,602 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] [2025-01-09 21:33:29,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:29,602 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:29,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:29,603 INFO L85 PathProgramCache]: Analyzing trace with hash -992447796, now seen corresponding path program 1 times [2025-01-09 21:33:29,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:29,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882413439] [2025-01-09 21:33:29,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:29,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:29,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:33:29,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:33:29,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:29,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:29,635 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:29,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:29,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882413439] [2025-01-09 21:33:29,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882413439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:29,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:29,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:29,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107134968] [2025-01-09 21:33:29,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:29,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:29,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:29,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:29,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:29,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 370 [2025-01-09 21:33:29,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 304 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:29,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:29,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 370 [2025-01-09 21:33:29,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:29,721 INFO L124 PetriNetUnfolderBase]: 34/491 cut-off events. [2025-01-09 21:33:29,721 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-01-09 21:33:29,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 491 events. 34/491 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1451 event pairs, 4 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 493. Up to 27 conditions per place. [2025-01-09 21:33:29,724 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 15 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-01-09 21:33:29,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 308 transitions, 660 flow [2025-01-09 21:33:29,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 969 transitions. [2025-01-09 21:33:29,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8729729729729729 [2025-01-09 21:33:29,727 INFO L175 Difference]: Start difference. First operand has 303 places, 304 transitions, 616 flow. Second operand 3 states and 969 transitions. [2025-01-09 21:33:29,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 308 transitions, 660 flow [2025-01-09 21:33:29,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 308 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:29,732 INFO L231 Difference]: Finished difference. Result has 303 places, 304 transitions, 620 flow [2025-01-09 21:33:29,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=303, PETRI_TRANSITIONS=304} [2025-01-09 21:33:29,733 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -43 predicate places. [2025-01-09 21:33:29,733 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 304 transitions, 620 flow [2025-01-09 21:33:29,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:29,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:29,733 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] [2025-01-09 21:33:29,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:29,734 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:29,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash -323399480, now seen corresponding path program 1 times [2025-01-09 21:33:29,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:29,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461970021] [2025-01-09 21:33:29,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:29,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:29,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:33:29,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:33:29,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:29,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:29,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:29,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461970021] [2025-01-09 21:33:29,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461970021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:29,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:29,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:29,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326592241] [2025-01-09 21:33:29,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:29,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:29,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:29,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:29,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:29,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 370 [2025-01-09 21:33:29,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 304 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:29,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:29,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 370 [2025-01-09 21:33:29,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:29,869 INFO L124 PetriNetUnfolderBase]: 34/490 cut-off events. [2025-01-09 21:33:29,870 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2025-01-09 21:33:29,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 490 events. 34/490 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1446 event pairs, 10 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 309. Up to 51 conditions per place. [2025-01-09 21:33:29,873 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 13 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2025-01-09 21:33:29,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 303 transitions, 648 flow [2025-01-09 21:33:29,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-01-09 21:33:29,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8621621621621621 [2025-01-09 21:33:29,875 INFO L175 Difference]: Start difference. First operand has 303 places, 304 transitions, 620 flow. Second operand 3 states and 957 transitions. [2025-01-09 21:33:29,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 303 transitions, 648 flow [2025-01-09 21:33:29,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 303 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:29,879 INFO L231 Difference]: Finished difference. Result has 303 places, 303 transitions, 620 flow [2025-01-09 21:33:29,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=303, PETRI_TRANSITIONS=303} [2025-01-09 21:33:29,880 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -43 predicate places. [2025-01-09 21:33:29,880 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 303 transitions, 620 flow [2025-01-09 21:33:29,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:29,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:29,880 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] [2025-01-09 21:33:29,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:29,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:29,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash -781172475, now seen corresponding path program 1 times [2025-01-09 21:33:29,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:29,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748492622] [2025-01-09 21:33:29,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:29,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:29,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:33:29,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:33:29,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:29,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:29,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:29,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748492622] [2025-01-09 21:33:29,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748492622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:29,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:29,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:29,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365857537] [2025-01-09 21:33:29,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:29,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:29,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:29,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:29,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:29,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 370 [2025-01-09 21:33:29,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 303 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:29,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:29,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 370 [2025-01-09 21:33:29,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:29,975 INFO L124 PetriNetUnfolderBase]: 34/489 cut-off events. [2025-01-09 21:33:29,976 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2025-01-09 21:33:29,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 489 events. 34/489 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1444 event pairs, 10 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 492. Up to 49 conditions per place. [2025-01-09 21:33:29,978 INFO L140 encePairwiseOnDemand]: 368/370 looper letters, 12 selfloop transitions, 1 changer transitions 0/302 dead transitions. [2025-01-09 21:33:29,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 302 transitions, 644 flow [2025-01-09 21:33:29,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-01-09 21:33:29,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8684684684684685 [2025-01-09 21:33:29,980 INFO L175 Difference]: Start difference. First operand has 303 places, 303 transitions, 620 flow. Second operand 3 states and 964 transitions. [2025-01-09 21:33:29,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 302 transitions, 644 flow [2025-01-09 21:33:29,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 302 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:29,984 INFO L231 Difference]: Finished difference. Result has 302 places, 302 transitions, 616 flow [2025-01-09 21:33:29,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=302, PETRI_TRANSITIONS=302} [2025-01-09 21:33:29,985 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -44 predicate places. [2025-01-09 21:33:29,985 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 302 transitions, 616 flow [2025-01-09 21:33:29,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:29,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:29,986 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] [2025-01-09 21:33:29,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:29,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:29,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:29,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1990434736, now seen corresponding path program 1 times [2025-01-09 21:33:29,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:29,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171491777] [2025-01-09 21:33:29,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:29,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:29,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:33:30,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:33:30,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:30,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:30,037 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:30,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171491777] [2025-01-09 21:33:30,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171491777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:30,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:30,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:30,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147568624] [2025-01-09 21:33:30,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:30,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:30,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:30,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:30,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:30,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 370 [2025-01-09 21:33:30,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 302 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:30,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:30,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 370 [2025-01-09 21:33:30,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:30,105 INFO L124 PetriNetUnfolderBase]: 34/488 cut-off events. [2025-01-09 21:33:30,105 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2025-01-09 21:33:30,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 488 events. 34/488 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1427 event pairs, 10 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 492. Up to 51 conditions per place. [2025-01-09 21:33:30,109 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 13 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2025-01-09 21:33:30,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 301 transitions, 644 flow [2025-01-09 21:33:30,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-01-09 21:33:30,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8621621621621621 [2025-01-09 21:33:30,112 INFO L175 Difference]: Start difference. First operand has 302 places, 302 transitions, 616 flow. Second operand 3 states and 957 transitions. [2025-01-09 21:33:30,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 301 transitions, 644 flow [2025-01-09 21:33:30,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 301 transitions, 643 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:30,116 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 617 flow [2025-01-09 21:33:30,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2025-01-09 21:33:30,118 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -44 predicate places. [2025-01-09 21:33:30,118 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 617 flow [2025-01-09 21:33:30,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:30,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:30,119 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] [2025-01-09 21:33:30,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:30,119 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:30,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:30,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1334568659, now seen corresponding path program 1 times [2025-01-09 21:33:30,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:30,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349681761] [2025-01-09 21:33:30,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:30,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:30,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:33:30,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:33:30,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:30,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:30,646 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:30,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:30,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349681761] [2025-01-09 21:33:30,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349681761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:30,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:30,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:30,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942498914] [2025-01-09 21:33:30,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:30,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:30,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:30,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:30,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:30,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 370 [2025-01-09 21:33:30,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 617 flow. Second operand has 6 states, 6 states have (on average 282.5) internal successors, (1695), 6 states have internal predecessors, (1695), 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:30,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:30,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 370 [2025-01-09 21:33:30,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:30,916 INFO L124 PetriNetUnfolderBase]: 73/655 cut-off events. [2025-01-09 21:33:30,916 INFO L125 PetriNetUnfolderBase]: For 34/35 co-relation queries the response was YES. [2025-01-09 21:33:30,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 655 events. 73/655 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2644 event pairs, 42 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 787. Up to 144 conditions per place. [2025-01-09 21:33:30,920 INFO L140 encePairwiseOnDemand]: 358/370 looper letters, 38 selfloop transitions, 10 changer transitions 0/299 dead transitions. [2025-01-09 21:33:30,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 299 transitions, 709 flow [2025-01-09 21:33:30,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1735 transitions. [2025-01-09 21:33:30,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7815315315315315 [2025-01-09 21:33:30,925 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 617 flow. Second operand 6 states and 1735 transitions. [2025-01-09 21:33:30,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 299 transitions, 709 flow [2025-01-09 21:33:30,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 299 transitions, 705 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:30,930 INFO L231 Difference]: Finished difference. Result has 303 places, 299 transitions, 629 flow [2025-01-09 21:33:30,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=629, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2025-01-09 21:33:30,931 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -43 predicate places. [2025-01-09 21:33:30,931 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 629 flow [2025-01-09 21:33:30,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.5) internal successors, (1695), 6 states have internal predecessors, (1695), 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:30,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:30,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:30,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:30,932 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:30,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash -899438198, now seen corresponding path program 1 times [2025-01-09 21:33:30,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:30,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701716686] [2025-01-09 21:33:30,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:30,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:30,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:33:30,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:33:30,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:30,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:30,977 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:30,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:30,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701716686] [2025-01-09 21:33:30,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701716686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:30,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:30,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:30,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001750467] [2025-01-09 21:33:30,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:30,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:30,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:30,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:30,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:30,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 370 [2025-01-09 21:33:30,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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:30,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:30,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 370 [2025-01-09 21:33:30,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:31,049 INFO L124 PetriNetUnfolderBase]: 37/537 cut-off events. [2025-01-09 21:33:31,049 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:33:31,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 537 events. 37/537 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1657 event pairs, 18 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 600. Up to 63 conditions per place. [2025-01-09 21:33:31,051 INFO L140 encePairwiseOnDemand]: 366/370 looper letters, 16 selfloop transitions, 1 changer transitions 0/296 dead transitions. [2025-01-09 21:33:31,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 296 transitions, 657 flow [2025-01-09 21:33:31,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2025-01-09 21:33:31,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8576576576576577 [2025-01-09 21:33:31,053 INFO L175 Difference]: Start difference. First operand has 303 places, 299 transitions, 629 flow. Second operand 3 states and 952 transitions. [2025-01-09 21:33:31,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 296 transitions, 657 flow [2025-01-09 21:33:31,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 296 transitions, 637 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:31,057 INFO L231 Difference]: Finished difference. Result has 297 places, 296 transitions, 605 flow [2025-01-09 21:33:31,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=297, PETRI_TRANSITIONS=296} [2025-01-09 21:33:31,059 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -49 predicate places. [2025-01-09 21:33:31,059 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 296 transitions, 605 flow [2025-01-09 21:33:31,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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:31,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:31,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:31,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:33:31,060 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:31,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash -362257131, now seen corresponding path program 1 times [2025-01-09 21:33:31,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:31,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593877213] [2025-01-09 21:33:31,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:31,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:31,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:33:31,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:33:31,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:31,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:31,099 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:31,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:31,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593877213] [2025-01-09 21:33:31,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593877213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:31,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:31,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:31,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551807927] [2025-01-09 21:33:31,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:31,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:31,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:31,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:31,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:31,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 370 [2025-01-09 21:33:31,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 296 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:31,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:31,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 370 [2025-01-09 21:33:31,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:31,216 INFO L124 PetriNetUnfolderBase]: 45/595 cut-off events. [2025-01-09 21:33:31,216 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2025-01-09 21:33:31,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 595 events. 45/595 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2173 event pairs, 18 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 627. Up to 72 conditions per place. [2025-01-09 21:33:31,218 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 16 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2025-01-09 21:33:31,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 295 transitions, 639 flow [2025-01-09 21:33:31,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2025-01-09 21:33:31,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567567567567568 [2025-01-09 21:33:31,221 INFO L175 Difference]: Start difference. First operand has 297 places, 296 transitions, 605 flow. Second operand 3 states and 951 transitions. [2025-01-09 21:33:31,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 295 transitions, 639 flow [2025-01-09 21:33:31,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 295 transitions, 638 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:31,224 INFO L231 Difference]: Finished difference. Result has 297 places, 295 transitions, 606 flow [2025-01-09 21:33:31,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=297, PETRI_TRANSITIONS=295} [2025-01-09 21:33:31,225 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -49 predicate places. [2025-01-09 21:33:31,225 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 295 transitions, 606 flow [2025-01-09 21:33:31,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:31,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:33:31,226 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:31,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:31,227 INFO L85 PathProgramCache]: Analyzing trace with hash -718439583, now seen corresponding path program 1 times [2025-01-09 21:33:31,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:31,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754897429] [2025-01-09 21:33:31,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:31,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:31,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 21:33:31,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 21:33:31,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:31,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:31,273 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:31,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:31,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754897429] [2025-01-09 21:33:31,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754897429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:31,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:31,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:31,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268923776] [2025-01-09 21:33:31,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:31,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:31,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:31,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:31,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:31,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 370 [2025-01-09 21:33:31,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 295 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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:31,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:31,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 370 [2025-01-09 21:33:31,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:31,341 INFO L124 PetriNetUnfolderBase]: 53/616 cut-off events. [2025-01-09 21:33:31,341 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2025-01-09 21:33:31,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 616 events. 53/616 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2337 event pairs, 26 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 670. Up to 85 conditions per place. [2025-01-09 21:33:31,343 INFO L140 encePairwiseOnDemand]: 366/370 looper letters, 16 selfloop transitions, 1 changer transitions 0/292 dead transitions. [2025-01-09 21:33:31,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 292 transitions, 634 flow [2025-01-09 21:33:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2025-01-09 21:33:31,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8576576576576577 [2025-01-09 21:33:31,345 INFO L175 Difference]: Start difference. First operand has 297 places, 295 transitions, 606 flow. Second operand 3 states and 952 transitions. [2025-01-09 21:33:31,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 292 transitions, 634 flow [2025-01-09 21:33:31,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 292 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:31,348 INFO L231 Difference]: Finished difference. Result has 294 places, 292 transitions, 598 flow [2025-01-09 21:33:31,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=294, PETRI_TRANSITIONS=292} [2025-01-09 21:33:31,350 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -52 predicate places. [2025-01-09 21:33:31,351 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 292 transitions, 598 flow [2025-01-09 21:33:31,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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:31,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:31,351 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] [2025-01-09 21:33:31,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:33:31,352 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:31,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:31,352 INFO L85 PathProgramCache]: Analyzing trace with hash -782077055, now seen corresponding path program 1 times [2025-01-09 21:33:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:31,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490598945] [2025-01-09 21:33:31,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:31,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 21:33:31,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 21:33:31,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:31,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:31,678 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:31,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:31,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490598945] [2025-01-09 21:33:31,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490598945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:31,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:31,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:31,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729081152] [2025-01-09 21:33:31,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:31,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:31,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:31,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:31,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:31,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 370 [2025-01-09 21:33:31,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 292 transitions, 598 flow. Second operand has 6 states, 6 states have (on average 306.1666666666667) internal successors, (1837), 6 states have internal predecessors, (1837), 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:31,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:31,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 370 [2025-01-09 21:33:31,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:31,920 INFO L124 PetriNetUnfolderBase]: 34/476 cut-off events. [2025-01-09 21:33:31,921 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2025-01-09 21:33:31,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 476 events. 34/476 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1390 event pairs, 10 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 492. Up to 49 conditions per place. [2025-01-09 21:33:31,923 INFO L140 encePairwiseOnDemand]: 365/370 looper letters, 21 selfloop transitions, 4 changer transitions 0/291 dead transitions. [2025-01-09 21:33:31,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 291 transitions, 646 flow [2025-01-09 21:33:31,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1855 transitions. [2025-01-09 21:33:31,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8355855855855856 [2025-01-09 21:33:31,926 INFO L175 Difference]: Start difference. First operand has 294 places, 292 transitions, 598 flow. Second operand 6 states and 1855 transitions. [2025-01-09 21:33:31,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 291 transitions, 646 flow [2025-01-09 21:33:31,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 291 transitions, 645 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:31,930 INFO L231 Difference]: Finished difference. Result has 297 places, 291 transitions, 603 flow [2025-01-09 21:33:31,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=603, PETRI_PLACES=297, PETRI_TRANSITIONS=291} [2025-01-09 21:33:31,931 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -49 predicate places. [2025-01-09 21:33:31,931 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 291 transitions, 603 flow [2025-01-09 21:33:31,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 306.1666666666667) internal successors, (1837), 6 states have internal predecessors, (1837), 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:31,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:31,932 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] [2025-01-09 21:33:31,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:33:31,932 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:31,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:31,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1374675490, now seen corresponding path program 1 times [2025-01-09 21:33:31,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:31,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105952476] [2025-01-09 21:33:31,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:31,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:31,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 21:33:31,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 21:33:31,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:31,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:31,973 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:31,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:31,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105952476] [2025-01-09 21:33:31,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105952476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:31,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:31,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:31,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290289831] [2025-01-09 21:33:31,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:31,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:31,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:31,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:31,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:31,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 370 [2025-01-09 21:33:31,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 291 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:31,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:31,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 370 [2025-01-09 21:33:31,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:32,062 INFO L124 PetriNetUnfolderBase]: 46/487 cut-off events. [2025-01-09 21:33:32,063 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2025-01-09 21:33:32,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 487 events. 46/487 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1568 event pairs, 16 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 518. Up to 72 conditions per place. [2025-01-09 21:33:32,065 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 16 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2025-01-09 21:33:32,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 290 transitions, 637 flow [2025-01-09 21:33:32,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:32,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2025-01-09 21:33:32,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567567567567568 [2025-01-09 21:33:32,068 INFO L175 Difference]: Start difference. First operand has 297 places, 291 transitions, 603 flow. Second operand 3 states and 951 transitions. [2025-01-09 21:33:32,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 290 transitions, 637 flow [2025-01-09 21:33:32,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 290 transitions, 630 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:33:32,072 INFO L231 Difference]: Finished difference. Result has 294 places, 290 transitions, 598 flow [2025-01-09 21:33:32,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=294, PETRI_TRANSITIONS=290} [2025-01-09 21:33:32,073 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -52 predicate places. [2025-01-09 21:33:32,073 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 290 transitions, 598 flow [2025-01-09 21:33:32,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:32,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:32,074 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] [2025-01-09 21:33:32,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:33:32,074 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:32,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:32,075 INFO L85 PathProgramCache]: Analyzing trace with hash -853612837, now seen corresponding path program 1 times [2025-01-09 21:33:32,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:32,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373955394] [2025-01-09 21:33:32,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:32,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:32,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 21:33:32,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 21:33:32,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:32,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:32,118 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:32,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:32,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373955394] [2025-01-09 21:33:32,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373955394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:32,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:32,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:32,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791021302] [2025-01-09 21:33:32,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:32,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:32,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:32,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:32,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:32,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 370 [2025-01-09 21:33:32,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 290 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 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:32,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:32,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 370 [2025-01-09 21:33:32,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:32,214 INFO L124 PetriNetUnfolderBase]: 62/574 cut-off events. [2025-01-09 21:33:32,214 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2025-01-09 21:33:32,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 574 events. 62/574 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2122 event pairs, 13 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 626. Up to 58 conditions per place. [2025-01-09 21:33:32,217 INFO L140 encePairwiseOnDemand]: 365/370 looper letters, 19 selfloop transitions, 3 changer transitions 0/294 dead transitions. [2025-01-09 21:33:32,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 294 transitions, 652 flow [2025-01-09 21:33:32,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 963 transitions. [2025-01-09 21:33:32,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8675675675675676 [2025-01-09 21:33:32,219 INFO L175 Difference]: Start difference. First operand has 294 places, 290 transitions, 598 flow. Second operand 3 states and 963 transitions. [2025-01-09 21:33:32,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 294 transitions, 652 flow [2025-01-09 21:33:32,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 294 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:32,223 INFO L231 Difference]: Finished difference. Result has 294 places, 290 transitions, 610 flow [2025-01-09 21:33:32,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=294, PETRI_TRANSITIONS=290} [2025-01-09 21:33:32,224 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -52 predicate places. [2025-01-09 21:33:32,224 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 290 transitions, 610 flow [2025-01-09 21:33:32,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 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:32,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:32,225 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] [2025-01-09 21:33:32,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:33:32,225 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:32,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:32,226 INFO L85 PathProgramCache]: Analyzing trace with hash -980927612, now seen corresponding path program 1 times [2025-01-09 21:33:32,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:32,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436013006] [2025-01-09 21:33:32,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:32,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:32,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 21:33:32,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 21:33:32,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:32,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:33:32,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:32,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436013006] [2025-01-09 21:33:32,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436013006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:32,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:32,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:32,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006796182] [2025-01-09 21:33:32,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:32,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:32,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:32,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:32,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:32,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 370 [2025-01-09 21:33:32,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 290 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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:32,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:32,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 370 [2025-01-09 21:33:32,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:32,353 INFO L124 PetriNetUnfolderBase]: 55/681 cut-off events. [2025-01-09 21:33:32,353 INFO L125 PetriNetUnfolderBase]: For 37/38 co-relation queries the response was YES. [2025-01-09 21:33:32,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 681 events. 55/681 cut-off events. For 37/38 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2672 event pairs, 23 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 755. Up to 74 conditions per place. [2025-01-09 21:33:32,356 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 15 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2025-01-09 21:33:32,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 289 transitions, 642 flow [2025-01-09 21:33:32,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:32,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 953 transitions. [2025-01-09 21:33:32,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8585585585585586 [2025-01-09 21:33:32,358 INFO L175 Difference]: Start difference. First operand has 294 places, 290 transitions, 610 flow. Second operand 3 states and 953 transitions. [2025-01-09 21:33:32,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 289 transitions, 642 flow [2025-01-09 21:33:32,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 289 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:32,362 INFO L231 Difference]: Finished difference. Result has 293 places, 289 transitions, 606 flow [2025-01-09 21:33:32,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=293, PETRI_TRANSITIONS=289} [2025-01-09 21:33:32,363 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -53 predicate places. [2025-01-09 21:33:32,363 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 289 transitions, 606 flow [2025-01-09 21:33:32,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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:32,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:32,365 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] [2025-01-09 21:33:32,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:33:32,365 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:32,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:32,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1826256653, now seen corresponding path program 1 times [2025-01-09 21:33:32,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930199487] [2025-01-09 21:33:32,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:32,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 21:33:32,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 21:33:32,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:32,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:33:32,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:32,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930199487] [2025-01-09 21:33:32,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930199487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:32,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:32,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:32,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141238801] [2025-01-09 21:33:32,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:32,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:32,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:32,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:32,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:32,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 370 [2025-01-09 21:33:32,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 289 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 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:32,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:32,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 370 [2025-01-09 21:33:32,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:32,527 INFO L124 PetriNetUnfolderBase]: 78/848 cut-off events. [2025-01-09 21:33:32,527 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-09 21:33:32,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 848 events. 78/848 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3990 event pairs, 28 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 967. Up to 106 conditions per place. [2025-01-09 21:33:32,530 INFO L140 encePairwiseOnDemand]: 363/370 looper letters, 18 selfloop transitions, 4 changer transitions 0/292 dead transitions. [2025-01-09 21:33:32,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 292 transitions, 661 flow [2025-01-09 21:33:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2025-01-09 21:33:32,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8639639639639639 [2025-01-09 21:33:32,532 INFO L175 Difference]: Start difference. First operand has 293 places, 289 transitions, 606 flow. Second operand 3 states and 959 transitions. [2025-01-09 21:33:32,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 292 transitions, 661 flow [2025-01-09 21:33:32,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 292 transitions, 657 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:32,536 INFO L231 Difference]: Finished difference. Result has 291 places, 289 transitions, 620 flow [2025-01-09 21:33:32,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=291, PETRI_TRANSITIONS=289} [2025-01-09 21:33:32,537 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -55 predicate places. [2025-01-09 21:33:32,537 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 289 transitions, 620 flow [2025-01-09 21:33:32,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 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:32,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:32,537 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] [2025-01-09 21:33:32,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:33:32,538 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:32,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:32,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1973640688, now seen corresponding path program 1 times [2025-01-09 21:33:32,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:32,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237800074] [2025-01-09 21:33:32,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:32,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:32,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 21:33:32,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 21:33:32,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:32,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:33:32,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237800074] [2025-01-09 21:33:32,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237800074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:32,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:32,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:32,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511628271] [2025-01-09 21:33:32,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:32,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:32,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:32,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:32,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:32,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 370 [2025-01-09 21:33:32,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 289 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:32,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:32,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 370 [2025-01-09 21:33:32,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:32,701 INFO L124 PetriNetUnfolderBase]: 63/652 cut-off events. [2025-01-09 21:33:32,701 INFO L125 PetriNetUnfolderBase]: For 74/82 co-relation queries the response was YES. [2025-01-09 21:33:32,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 652 events. 63/652 cut-off events. For 74/82 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2893 event pairs, 17 based on Foata normal form. 2/576 useless extension candidates. Maximal degree in co-relation 785. Up to 69 conditions per place. [2025-01-09 21:33:32,704 INFO L140 encePairwiseOnDemand]: 365/370 looper letters, 16 selfloop transitions, 2 changer transitions 2/290 dead transitions. [2025-01-09 21:33:32,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 290 transitions, 666 flow [2025-01-09 21:33:32,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2025-01-09 21:33:32,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.863063063063063 [2025-01-09 21:33:32,706 INFO L175 Difference]: Start difference. First operand has 291 places, 289 transitions, 620 flow. Second operand 3 states and 958 transitions. [2025-01-09 21:33:32,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 290 transitions, 666 flow [2025-01-09 21:33:32,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 290 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:32,710 INFO L231 Difference]: Finished difference. Result has 290 places, 285 transitions, 611 flow [2025-01-09 21:33:32,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=611, PETRI_PLACES=290, PETRI_TRANSITIONS=285} [2025-01-09 21:33:32,711 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -56 predicate places. [2025-01-09 21:33:32,711 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 285 transitions, 611 flow [2025-01-09 21:33:32,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:32,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:32,712 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] [2025-01-09 21:33:32,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:33:32,712 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:32,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:32,713 INFO L85 PathProgramCache]: Analyzing trace with hash 719146925, now seen corresponding path program 1 times [2025-01-09 21:33:32,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:32,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164179279] [2025-01-09 21:33:32,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:32,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:32,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 21:33:32,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 21:33:32,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:32,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:33:32,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:32,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164179279] [2025-01-09 21:33:32,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164179279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:32,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:32,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:33:32,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423494836] [2025-01-09 21:33:32,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:32,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:33:32,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:32,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:33:32,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:33:33,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 370 [2025-01-09 21:33:33,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 285 transitions, 611 flow. Second operand has 7 states, 7 states have (on average 301.0) internal successors, (2107), 7 states have internal predecessors, (2107), 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:33,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:33,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 370 [2025-01-09 21:33:33,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:33,283 INFO L124 PetriNetUnfolderBase]: 91/1159 cut-off events. [2025-01-09 21:33:33,283 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-09 21:33:33,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 1159 events. 91/1159 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5711 event pairs, 19 based on Foata normal form. 0/1034 useless extension candidates. Maximal degree in co-relation 1397. Up to 65 conditions per place. [2025-01-09 21:33:33,289 INFO L140 encePairwiseOnDemand]: 356/370 looper letters, 43 selfloop transitions, 15 changer transitions 0/309 dead transitions. [2025-01-09 21:33:33,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 309 transitions, 801 flow [2025-01-09 21:33:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:33:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:33:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3032 transitions. [2025-01-09 21:33:33,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8194594594594594 [2025-01-09 21:33:33,294 INFO L175 Difference]: Start difference. First operand has 290 places, 285 transitions, 611 flow. Second operand 10 states and 3032 transitions. [2025-01-09 21:33:33,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 309 transitions, 801 flow [2025-01-09 21:33:33,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 309 transitions, 797 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:33,299 INFO L231 Difference]: Finished difference. Result has 299 places, 292 transitions, 681 flow [2025-01-09 21:33:33,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=681, PETRI_PLACES=299, PETRI_TRANSITIONS=292} [2025-01-09 21:33:33,300 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -47 predicate places. [2025-01-09 21:33:33,300 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 292 transitions, 681 flow [2025-01-09 21:33:33,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 301.0) internal successors, (2107), 7 states have internal predecessors, (2107), 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:33,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:33,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:33,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:33:33,301 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:33,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:33,302 INFO L85 PathProgramCache]: Analyzing trace with hash 801422361, now seen corresponding path program 1 times [2025-01-09 21:33:33,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:33,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073192724] [2025-01-09 21:33:33,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:33,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:33,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 21:33:33,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 21:33:33,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:33,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:33:33,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:33,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073192724] [2025-01-09 21:33:33,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073192724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:33,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:33,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:33,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043362249] [2025-01-09 21:33:33,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:33,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:33,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:33,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:33,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:33,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 370 [2025-01-09 21:33:33,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 292 transitions, 681 flow. Second operand has 3 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 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:33,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:33,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 370 [2025-01-09 21:33:33,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:33,518 INFO L124 PetriNetUnfolderBase]: 136/1073 cut-off events. [2025-01-09 21:33:33,518 INFO L125 PetriNetUnfolderBase]: For 176/201 co-relation queries the response was YES. [2025-01-09 21:33:33,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 1073 events. 136/1073 cut-off events. For 176/201 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5761 event pairs, 57 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1486. Up to 188 conditions per place. [2025-01-09 21:33:33,523 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 20 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2025-01-09 21:33:33,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 295 transitions, 741 flow [2025-01-09 21:33:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-01-09 21:33:33,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8621621621621621 [2025-01-09 21:33:33,525 INFO L175 Difference]: Start difference. First operand has 299 places, 292 transitions, 681 flow. Second operand 3 states and 957 transitions. [2025-01-09 21:33:33,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 295 transitions, 741 flow [2025-01-09 21:33:33,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 295 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:33,528 INFO L231 Difference]: Finished difference. Result has 298 places, 291 transitions, 677 flow [2025-01-09 21:33:33,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=677, PETRI_PLACES=298, PETRI_TRANSITIONS=291} [2025-01-09 21:33:33,529 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -48 predicate places. [2025-01-09 21:33:33,529 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 291 transitions, 677 flow [2025-01-09 21:33:33,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 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:33,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:33,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:33,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:33:33,530 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:33,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:33,531 INFO L85 PathProgramCache]: Analyzing trace with hash 800468055, now seen corresponding path program 1 times [2025-01-09 21:33:33,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:33,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232262414] [2025-01-09 21:33:33,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:33,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:33,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 21:33:33,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 21:33:33,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:33,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:33:33,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:33,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232262414] [2025-01-09 21:33:33,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232262414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:33,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:33,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:33,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765071284] [2025-01-09 21:33:33,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:33,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:33,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:33,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:33,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:33,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 370 [2025-01-09 21:33:33,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 291 transitions, 677 flow. Second operand has 3 states, 3 states have (on average 317.0) internal successors, (951), 3 states have internal predecessors, (951), 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:33,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:33,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 370 [2025-01-09 21:33:33,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:33,696 INFO L124 PetriNetUnfolderBase]: 110/1090 cut-off events. [2025-01-09 21:33:33,696 INFO L125 PetriNetUnfolderBase]: For 140/159 co-relation queries the response was YES. [2025-01-09 21:33:33,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 1090 events. 110/1090 cut-off events. For 140/159 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5776 event pairs, 18 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 1474. Up to 130 conditions per place. [2025-01-09 21:33:33,702 INFO L140 encePairwiseOnDemand]: 365/370 looper letters, 18 selfloop transitions, 3 changer transitions 0/294 dead transitions. [2025-01-09 21:33:33,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 294 transitions, 734 flow [2025-01-09 21:33:33,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-01-09 21:33:33,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8684684684684685 [2025-01-09 21:33:33,705 INFO L175 Difference]: Start difference. First operand has 298 places, 291 transitions, 677 flow. Second operand 3 states and 964 transitions. [2025-01-09 21:33:33,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 294 transitions, 734 flow [2025-01-09 21:33:33,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 294 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:33,709 INFO L231 Difference]: Finished difference. Result has 297 places, 290 transitions, 682 flow [2025-01-09 21:33:33,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=297, PETRI_TRANSITIONS=290} [2025-01-09 21:33:33,710 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -49 predicate places. [2025-01-09 21:33:33,710 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 290 transitions, 682 flow [2025-01-09 21:33:33,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.0) internal successors, (951), 3 states have internal predecessors, (951), 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:33,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:33,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:33,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:33:33,711 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:33,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:33,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1275463007, now seen corresponding path program 1 times [2025-01-09 21:33:33,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:33,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747022285] [2025-01-09 21:33:33,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:33,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:33,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 21:33:33,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 21:33:33,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:33,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:33:33,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:33,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747022285] [2025-01-09 21:33:33,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747022285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:33,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:33,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:33,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989268660] [2025-01-09 21:33:33,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:33,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:33,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:33,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:33,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:33,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 370 [2025-01-09 21:33:33,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 290 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 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:33,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:33,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 370 [2025-01-09 21:33:33,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:33,881 INFO L124 PetriNetUnfolderBase]: 112/1078 cut-off events. [2025-01-09 21:33:33,881 INFO L125 PetriNetUnfolderBase]: For 210/228 co-relation queries the response was YES. [2025-01-09 21:33:33,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1575 conditions, 1078 events. 112/1078 cut-off events. For 210/228 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5584 event pairs, 45 based on Foata normal form. 0/1010 useless extension candidates. Maximal degree in co-relation 1501. Up to 168 conditions per place. [2025-01-09 21:33:33,886 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 21 selfloop transitions, 3 changer transitions 5/293 dead transitions. [2025-01-09 21:33:33,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 293 transitions, 747 flow [2025-01-09 21:33:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2025-01-09 21:33:33,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.863063063063063 [2025-01-09 21:33:33,889 INFO L175 Difference]: Start difference. First operand has 297 places, 290 transitions, 682 flow. Second operand 3 states and 958 transitions. [2025-01-09 21:33:33,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 293 transitions, 747 flow [2025-01-09 21:33:33,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 293 transitions, 740 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:33,893 INFO L231 Difference]: Finished difference. Result has 296 places, 285 transitions, 660 flow [2025-01-09 21:33:33,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=296, PETRI_TRANSITIONS=285} [2025-01-09 21:33:33,893 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -50 predicate places. [2025-01-09 21:33:33,894 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 285 transitions, 660 flow [2025-01-09 21:33:33,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 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:33,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:33,894 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] [2025-01-09 21:33:33,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:33:33,894 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:33,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1386951152, now seen corresponding path program 1 times [2025-01-09 21:33:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:33,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485267691] [2025-01-09 21:33:33,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:33,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:33,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-09 21:33:33,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-09 21:33:33,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:33,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:33:34,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:34,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485267691] [2025-01-09 21:33:34,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485267691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:34,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:34,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:34,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997538780] [2025-01-09 21:33:34,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:34,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:34,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:34,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:34,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:34,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 370 [2025-01-09 21:33:34,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 285 transitions, 660 flow. Second operand has 6 states, 6 states have (on average 300.1666666666667) internal successors, (1801), 6 states have internal predecessors, (1801), 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:34,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:34,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 370 [2025-01-09 21:33:34,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:34,589 INFO L124 PetriNetUnfolderBase]: 168/1128 cut-off events. [2025-01-09 21:33:34,590 INFO L125 PetriNetUnfolderBase]: For 176/177 co-relation queries the response was YES. [2025-01-09 21:33:34,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1689 conditions, 1128 events. 168/1128 cut-off events. For 176/177 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6314 event pairs, 14 based on Foata normal form. 0/1060 useless extension candidates. Maximal degree in co-relation 1613. Up to 176 conditions per place. [2025-01-09 21:33:34,596 INFO L140 encePairwiseOnDemand]: 363/370 looper letters, 47 selfloop transitions, 6 changer transitions 0/303 dead transitions. [2025-01-09 21:33:34,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 303 transitions, 834 flow [2025-01-09 21:33:34,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1835 transitions. [2025-01-09 21:33:34,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8265765765765766 [2025-01-09 21:33:34,599 INFO L175 Difference]: Start difference. First operand has 296 places, 285 transitions, 660 flow. Second operand 6 states and 1835 transitions. [2025-01-09 21:33:34,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 303 transitions, 834 flow [2025-01-09 21:33:34,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 303 transitions, 813 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-01-09 21:33:34,603 INFO L231 Difference]: Finished difference. Result has 290 places, 283 transitions, 647 flow [2025-01-09 21:33:34,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=647, PETRI_PLACES=290, PETRI_TRANSITIONS=283} [2025-01-09 21:33:34,604 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -56 predicate places. [2025-01-09 21:33:34,604 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 283 transitions, 647 flow [2025-01-09 21:33:34,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 300.1666666666667) internal successors, (1801), 6 states have internal predecessors, (1801), 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:34,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:34,605 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] [2025-01-09 21:33:34,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:33:34,605 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:34,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:34,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1420153230, now seen corresponding path program 1 times [2025-01-09 21:33:34,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:34,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420659936] [2025-01-09 21:33:34,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:34,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:34,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 21:33:34,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 21:33:34,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:34,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:34,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:33:34,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:34,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420659936] [2025-01-09 21:33:34,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420659936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:34,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:34,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:34,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216043688] [2025-01-09 21:33:34,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:34,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:34,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:34,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:34,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:34,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 370 [2025-01-09 21:33:34,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 283 transitions, 647 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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:34,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:34,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 370 [2025-01-09 21:33:34,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:34,833 INFO L124 PetriNetUnfolderBase]: 113/1179 cut-off events. [2025-01-09 21:33:34,834 INFO L125 PetriNetUnfolderBase]: For 208/211 co-relation queries the response was YES. [2025-01-09 21:33:34,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1628 conditions, 1179 events. 113/1179 cut-off events. For 208/211 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6259 event pairs, 21 based on Foata normal form. 0/1125 useless extension candidates. Maximal degree in co-relation 1557. Up to 103 conditions per place. [2025-01-09 21:33:34,841 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 25 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-01-09 21:33:34,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 293 transitions, 746 flow [2025-01-09 21:33:34,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-01-09 21:33:34,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.872072072072072 [2025-01-09 21:33:34,843 INFO L175 Difference]: Start difference. First operand has 290 places, 283 transitions, 647 flow. Second operand 3 states and 968 transitions. [2025-01-09 21:33:34,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 293 transitions, 746 flow [2025-01-09 21:33:34,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 293 transitions, 730 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:34,848 INFO L231 Difference]: Finished difference. Result has 287 places, 283 transitions, 643 flow [2025-01-09 21:33:34,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=643, PETRI_PLACES=287, PETRI_TRANSITIONS=283} [2025-01-09 21:33:34,849 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -59 predicate places. [2025-01-09 21:33:34,849 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 283 transitions, 643 flow [2025-01-09 21:33:34,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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:34,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:34,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:34,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:33:34,849 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-01-09 21:33:34,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:34,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1366984588, now seen corresponding path program 1 times [2025-01-09 21:33:34,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:34,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958452367] [2025-01-09 21:33:34,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:34,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:34,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 21:33:34,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 21:33:34,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:34,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:33:34,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:34,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958452367] [2025-01-09 21:33:34,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958452367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:34,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:34,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:34,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141365153] [2025-01-09 21:33:34,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:34,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:34,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:34,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:34,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 370 [2025-01-09 21:33:34,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 283 transitions, 643 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:34,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:34,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 370 [2025-01-09 21:33:34,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:35,087 INFO L124 PetriNetUnfolderBase]: 153/1359 cut-off events. [2025-01-09 21:33:35,087 INFO L125 PetriNetUnfolderBase]: For 188/200 co-relation queries the response was YES. [2025-01-09 21:33:35,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1899 conditions, 1359 events. 153/1359 cut-off events. For 188/200 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7906 event pairs, 60 based on Foata normal form. 1/1288 useless extension candidates. Maximal degree in co-relation 1828. Up to 175 conditions per place. [2025-01-09 21:33:35,092 INFO L140 encePairwiseOnDemand]: 367/370 looper letters, 0 selfloop transitions, 0 changer transitions 287/287 dead transitions. [2025-01-09 21:33:35,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 287 transitions, 707 flow [2025-01-09 21:33:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:35,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 961 transitions. [2025-01-09 21:33:35,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8657657657657658 [2025-01-09 21:33:35,094 INFO L175 Difference]: Start difference. First operand has 287 places, 283 transitions, 643 flow. Second operand 3 states and 961 transitions. [2025-01-09 21:33:35,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 287 transitions, 707 flow [2025-01-09 21:33:35,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 287 transitions, 705 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:35,097 INFO L231 Difference]: Finished difference. Result has 287 places, 0 transitions, 0 flow [2025-01-09 21:33:35,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=287, PETRI_TRANSITIONS=0} [2025-01-09 21:33:35,098 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -59 predicate places. [2025-01-09 21:33:35,098 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 0 transitions, 0 flow [2025-01-09 21:33:35,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:35,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (116 of 117 remaining) [2025-01-09 21:33:35,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (115 of 117 remaining) [2025-01-09 21:33:35,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (114 of 117 remaining) [2025-01-09 21:33:35,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (113 of 117 remaining) [2025-01-09 21:33:35,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (112 of 117 remaining) [2025-01-09 21:33:35,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (111 of 117 remaining) [2025-01-09 21:33:35,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (110 of 117 remaining) [2025-01-09 21:33:35,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (109 of 117 remaining) [2025-01-09 21:33:35,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (108 of 117 remaining) [2025-01-09 21:33:35,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (107 of 117 remaining) [2025-01-09 21:33:35,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (106 of 117 remaining) [2025-01-09 21:33:35,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (105 of 117 remaining) [2025-01-09 21:33:35,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (104 of 117 remaining) [2025-01-09 21:33:35,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (103 of 117 remaining) [2025-01-09 21:33:35,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (102 of 117 remaining) [2025-01-09 21:33:35,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (101 of 117 remaining) [2025-01-09 21:33:35,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (100 of 117 remaining) [2025-01-09 21:33:35,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (99 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (98 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (97 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (96 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (95 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (94 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (93 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (92 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (91 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (90 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (89 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (88 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (87 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (86 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (85 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (84 of 117 remaining) [2025-01-09 21:33:35,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (83 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (82 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (81 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (80 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (79 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (78 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (77 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (76 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (75 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (74 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (73 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (72 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (71 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (70 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (69 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (68 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (67 of 117 remaining) [2025-01-09 21:33:35,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (66 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (65 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (64 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (63 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (62 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (61 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (60 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (59 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (58 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (57 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (56 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (55 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (54 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (53 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (52 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (51 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (50 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (46 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (43 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (42 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (40 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (39 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (38 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (36 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (33 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (32 of 117 remaining) [2025-01-09 21:33:35,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (31 of 117 remaining) [2025-01-09 21:33:35,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (30 of 117 remaining) [2025-01-09 21:33:35,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (29 of 117 remaining) [2025-01-09 21:33:35,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (28 of 117 remaining) [2025-01-09 21:33:35,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (27 of 117 remaining) [2025-01-09 21:33:35,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (26 of 117 remaining) [2025-01-09 21:33:35,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (25 of 117 remaining) [2025-01-09 21:33:35,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 117 remaining) [2025-01-09 21:33:35,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 117 remaining) [2025-01-09 21:33:35,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 117 remaining) [2025-01-09 21:33:35,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 117 remaining) [2025-01-09 21:33:35,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 117 remaining) [2025-01-09 21:33:35,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 117 remaining) [2025-01-09 21:33:35,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 117 remaining) [2025-01-09 21:33:35,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (17 of 117 remaining) [2025-01-09 21:33:35,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (16 of 117 remaining) [2025-01-09 21:33:35,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (15 of 117 remaining) [2025-01-09 21:33:35,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (14 of 117 remaining) [2025-01-09 21:33:35,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (13 of 117 remaining) [2025-01-09 21:33:35,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 117 remaining) [2025-01-09 21:33:35,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (11 of 117 remaining) [2025-01-09 21:33:35,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (10 of 117 remaining) [2025-01-09 21:33:35,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (9 of 117 remaining) [2025-01-09 21:33:35,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (8 of 117 remaining) [2025-01-09 21:33:35,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (7 of 117 remaining) [2025-01-09 21:33:35,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (6 of 117 remaining) [2025-01-09 21:33:35,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (5 of 117 remaining) [2025-01-09 21:33:35,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (4 of 117 remaining) [2025-01-09 21:33:35,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (3 of 117 remaining) [2025-01-09 21:33:35,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (2 of 117 remaining) [2025-01-09 21:33:35,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (1 of 117 remaining) [2025-01-09 21:33:35,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (0 of 117 remaining) [2025-01-09 21:33:35,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:33:35,107 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] [2025-01-09 21:33:35,111 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:35,111 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:35,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:35 BasicIcfg [2025-01-09 21:33:35,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:35,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:35,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:35,116 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:35,116 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:28" (3/4) ... [2025-01-09 21:33:35,117 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:35,119 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:35,119 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:35,123 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-01-09 21:33:35,123 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:35,123 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:33:35,123 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:35,177 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:35,177 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:35,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:35,178 INFO L158 Benchmark]: Toolchain (without parser) took 7725.87ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 111.2MB in the beginning and 411.7MB in the end (delta: -300.6MB). Peak memory consumption was 202.6MB. Max. memory is 16.1GB. [2025-01-09 21:33:35,178 INFO L158 Benchmark]: CDTParser took 1.46ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:35,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.94ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 97.9MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:35,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.33ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:35,179 INFO L158 Benchmark]: Boogie Preprocessor took 28.76ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:35,179 INFO L158 Benchmark]: RCFGBuilder took 800.43ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 74.4MB in the end (delta: 18.0MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2025-01-09 21:33:35,179 INFO L158 Benchmark]: TraceAbstraction took 6591.64ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 73.6MB in the beginning and 420.1MB in the end (delta: -346.5MB). Peak memory consumption was 154.2MB. Max. memory is 16.1GB. [2025-01-09 21:33:35,179 INFO L158 Benchmark]: Witness Printer took 61.69ms. Allocated memory is still 645.9MB. Free memory was 420.1MB in the beginning and 411.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:35,180 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.46ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.94ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 97.9MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.33ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.76ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 800.43ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 74.4MB in the end (delta: 18.0MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6591.64ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 73.6MB in the beginning and 420.1MB in the end (delta: -346.5MB). Peak memory consumption was 154.2MB. Max. memory is 16.1GB. * Witness Printer took 61.69ms. Allocated memory is still 645.9MB. Free memory was 420.1MB in the beginning and 411.7MB 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: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: 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: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: 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: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: 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: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: 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: 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: 106]: 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 5 procedures, 480 locations, 117 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: 6.5s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1050 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 599 mSDsluCounter, 296 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1663 IncrementalHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 110 mSDtfsCounter, 1663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=714occurred in iteration=0, InterpolantAutomatonStates: 91, 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.9s InterpolantComputationTime, 3058 NumberOfCodeBlocks, 3058 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3033 ConstructedInterpolants, 0 QuantifiedInterpolants, 3979 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 13/13 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 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:35,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE